Algorithms - ESA 2006 : 14th... | Buy

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 real-world applications and engineering of algorithms in various fields.

Origami, linkages, and polyhedra : folding with algorithms	p. 1
Reliable and efficient geometric computing	p. 2
Some computational challenges in today's bio-medicine	p. 3
Kinetic collision detection for convex fat objects	p. 4
Dynamic connectivity for axis-parallel rectangles	p. 16
Single machine precedence constrained scheduling is a vertex cover problem	p. 28
Cooperative TSP	p. 40
Frechet distance for curves, revisited	p. 52
Resource allocation in bounded degree trees	p. 64
Dynamic algorithms for graph spanners	p. 76
Latency constrained aggregation in sensor networks	p. 88
Competitive analysis of flash-memory algorithms	p. 100
Contention resolution with heterogeneous job sizes	p. 112
Deciding relaxed two-colorability - a hardness jump	p. 124
Negative examples for sequential importance sampling of binary contingency tables	p. 136
Estimating entropy over data streams	p. 148
Necklaces, convolutions, and X + Y	p. 160
Purely functional worst case constant time catenable sorted lists	p. 172
Taxes for linear atomic congestion games	p. 184
Spanners with slack	p. 196
Compressed indexes for approximate string matching	p. 208
Traversing the machining graph	p. 220
Efficient computation of Nash equilibria for very sparse win-lose bimatrix games	p. 232
Distributed almost exact approximations for minor-closed families	p. 244
Spectral clustering by recursive partitioning	p. 256
Finite termination of "augmenting path" algorithms in the presence of irrational problem data	p. 268
Dynamic programming and fast matrix multiplication	p. 280
Near-entropy hotlink assignments	p. 292
Subspace sampling and relative-error matrix approximation : column-row-based methods	p. 304
Finding total uniomodularity in optimization problems solved by linear programs	p. 315
Preemptive online scheduling : optimal algorithms for all speeds	p. 327
On the complexity of the multiplication method for monotone CNF/DNF dualization	p. 340
Lower and upper bounds on FIFO buffer management in QoS switches	p. 352
Graph coloring with rejection	p. 364
A doubling dimension threshold [Theta](log log n) for augmented graph navigability	p. 376
Violator spaces : structure and algorithms	p. 387
Region-restricted clustering for geographic data mining	p. 399
An O(n[superscript 3](log log n/log n)[superscript 5/4]) time algorithm for all pairs shortest paths	p. 411
Cheating by men in the Gale-Shapley stable matching algorithm	p. 418
Approximating almost all instances of Max-Cut within a ratio above the Hastad threshold	p. 432
Enumerating spanning and connected subsets in graphs and matroids	p. 444
Less hashing, same performance : building a better bloom filter	p. 456
A unified approach to approximating partial covering problems	p. 468
Navigating low-dimensional and hierarchical population networks	p. 480
Popular matchings in the capacitated house allocation problem	p. 492
Inner-product based wavelet synopses for range-sum queries	p. 504
Approximation in preemptive stochastic online scheduling	p. 516
Greedy in approximation algorithms	p. 528
I/O-efficient undirected shortest paths with unbounded edge lengths	p. 540
Stochastic shortest paths via quasi-convex maximization	p. 552
Path hitting in acyclic graphs	p. 564
Minimum transversals in posi-modular systems	p. 576
An LP-designed algorithm for constraint satisfaction	p. 588
Approximate k-Steiner forests via the Lagrangian relaxation technique with internal preprocessing	p. 600
Balancing applied to maximum network flow problems	p. 612
Out-of-order event processing in kinetic data structures	p. 624
Kinetic algorithms via self-adjusting computation	p. 636
Parallel machine scheduling through column generation : minimax objective functions	p. 648
Reporting flock patterns	p. 660
On exact algorithms for treewidth	p. 672
An improved construction for counting bloom filters	p. 684
An MINLP solution method for a water network problem	p. 696
Skewed binary search trees	p. 708
Algorithmic aspects of proportional symbol maps	p. 720
Does path cleaning help in dynamic all-pairs shortest paths?	p. 732
Multiline addressing by network flow	p. 744
The engineering of a compression boosting library : theory vs practice in BWT compression	p. 756
The price of resiliency : a case study on sorting with memory faults	p. 768
How branch mispredictions affect quicksort	p. 780
Robust, generic and efficient construction of envelopes of surfaces in three-dimensional spaces	p. 792
Engineering highway hierarchies	p. 804
Univariate polynomial real root isolation : continued fractions revisited	p. 817
Exact and efficient construction of planar Minkowski sums using the convolution method	p. 829
Table of Contents provided by Blackwell. All Rights Reserved.

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.