Description 
1 online resource (xviii, 843 pages) : illustrations 
Series 
Lecture notes in computer science. 03029743 ; 4168 

LNCS sublibrary. SL 1, Theoretical computer science and general issues 

Lecture notes in computer science ; 4168.


LNCS sublibrary. SL 1, Theoretical computer science and general issues.

Contents 
Invited Lectures  Origami, Linkages, and Polyhedra: Folding with Algorithms  Reliable and Efficient Geometric Computing  Some Computational Challenges in Today's Biomedicine  Contributed Papers: Design and Analysis Track  Kinetic Collision Detection for Convex Fat Objects  Dynamic Connectivity for AxisParallel Rectangles  Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem  Cooperative TSP  Fréchet Distance for Curves, Revisited  Resource Allocation in Bounded Degree Trees  Dynamic Algorithms for Graph Spanners  Latency Constrained Aggregation in Sensor Networks  Competitive Analysis of FlashMemory Algorithms  Contention Resolution with Heterogeneous Job Sizes  Deciding Relaxed TwoColorabilityA Hardness Jump  Negative Examples for Sequential Importance Sampling of Binary Contingency Tables  Estimating Entropy over Data Streams  Necklaces, Convolutions, and X + Y  Purely Functional Worst Case Constant Time Catenable Sorted Lists  Taxes for Linear Atomic Congestion Games  Spanners with Slack  Compressed Indexes for Approximate String Matching  Traversing the Machining Graph  Efficient Computation of Nash Equilibria for Very Sparse WinLose Bimatrix Games  Distributed Almost Exact Approximations for MinorClosed Families  Spectral Clustering by Recursive Partitioning  Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data  Dynamic Programming and Fast Matrix Multiplication  NearEntropy Hotlink Assignments  Subspace Sampling and RelativeError Matrix Approximation: ColumnRowBased Methods  Finding Total Unimodularity in Optimization Problems Solved by Linear Programs  Preemptive Online Scheduling: Optimal Algorithms for All Speeds  On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization  Lower and Upper Bounds on FIFO Buffer Management in QoS Switches  Graph Coloring with Rejection  A Doubling Dimension Threshold?(loglogn) for Augmented Graph Navigability  Violator Spaces: Structure and Algorithms  RegionRestricted Clustering for Geographic Data Mining  An O(n 3 (loglogn/logn)5/4) Time Algorithm for All Pairs Shortest Paths  Cheating by Men in the GaleShapley Stable Matching Algorithm  Approximating Almost All Instances of MaxCut Within a Ratio Above the Håstad Threshold  Enumerating Spanning and Connected Subsets in Graphs and Matroids  Less Hashing, Same Performance: Building a Better Bloom Filter  A Unified Approach to Approximating Partial Covering Problems  Navigating LowDimensional and Hierarchical Population Networks  Popular Matchings in the Capacitated House Allocation Problem  InnerProduct Based Wavelet Synopses for RangeSum Queries  Approximation in Preemptive Stochastic Online Scheduling  Greedy in Approximation Algorithms  I/OEfficient Undirected Shortest Paths with Unbounded Edge Lengths  Stochastic Shortest Paths Via Quasiconvex Maximization  Path Hitting in Acyclic Graphs  Minimum Transversals in Posimodular Systems  An LPDesigned Algorithm for Constraint Satisfaction  Approximate kSteiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing  Balancing Applied to Maximum Network Flow Problems  Contributed Papers: Engineering and Applications Track  OutofOrder Event Processing in Kinetic Data Structures  Kinetic Algorithms Via Selfadjusting Computation  Parallel Machine Scheduling Through Column Generation: Minimax Objective Functions  Reporting Flock Patterns  On Exact Algorithms for Treewidth  An Improved Construction for Counting Bloom Filters  An MINLP Solution Method for a Water Network Problem  Skewed Binary Search Trees  Algorithmic Aspects of Proportional Symbol Maps  Does Path Cleaning Help in Dynamic AllPairs Shortest Paths?  Multiline Addressing by Network Flow  The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression  The Price of Resiliency: A Case Study on Sorting with Memory Faults  How Branch Mispredictions Affect Quicksort  Robust, Generic and Efficient Construction of Envelopes of Surfaces in ThreeDimensional Spaces  Engineering Highway Hierarchies  Univariate Polynomial Real Root Isolation: Continued Fractions Revisited  Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method 
Summary 
This book constitutes the refereed proceedings of the 14th Annual European Symposium on Algorithms, ESA 2006, held in Zurich, Switzerland, in September 2006, in the context of the combined conference ALGO 2006. The 70 revised full papers presented together with abstracts of 3 invited lectures were carefully reviewed and selected from 287 submissions. The papers address all current subjects in algorithmics, reaching from design and analysis issues of algorithms over to realworld applications and engineering of algorithms in various fields 
Analysis 
algoritmen 

algorithms 

computeranalyse 

computer analysis 

computergrafie 

computer graphics 

wiskunde 

mathematics 

computertechnieken 

computer techniques 

computerwetenschappen 

computer sciences 

computernetwerken 

computer networks 

gegevensstructuren 

data structures 

numerieke methoden 

numerical methods 

Information and Communication Technology (General) 

Informatie en communicatietechnologie (algemeen) 
Notes 
"EATCS"Cover 
Bibliography 
Includes bibliographical references and index 
Notes 
Print version record 
Subject 
Computer algorithms  Congresses


Algorithmes.


Computer algorithms.


Computer algorithms.


Algorithmus


Zurich <2006>

Genre/Form 
Conference papers and proceedings.


Conference papers and proceedings.


Actes de congrès.

Form 
Electronic book

Author 
Azar, Yossi.


Erlebach, Thomas.


European Association for Theoretical Computer Science

LC no. 
2006931490 
ISBN 
9783540388760 

3540388761 

6611370021 

9786611370022 
