Approximation and Online Algorithms : 4th International Workshop, WAOA 2006. Zurich, Switzerland, September 2006, Revised Papers

Thomas Erlebach; Christos Kaklamanis (editor)

ISBN 10: 3540695133 / ISBN 13: 9783540695134

Editore: Springer, 2006

Riguardo questo articolo

Lecture Notes in Computer Science, 4368. Usual ex-library features. The interior is clean and tight. Binding is good. Cover shows slight wear. 344 pages. Codice articolo 033551

Dati bibliografici

Titolo: Approximation and Online Algorithms : 4th ...

Casa editrice: Springer

Data di pubblicazione: 2006

Legatura: Soft Cover

Condizione: Good

Tipologia articolo: Ex-Library

Descrizione articolo

Riassunto:

This book constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Approximation and Online Algorithms, WAOA 2006, held in Zurich, Switzerland in September 2006 as part of the ALGO 2006 conference event. The 26 revised full papers presented were carefully reviewed and selected from 62 submissions.

Contenuti:

Approximation Algorithms for Scheduling Problems with Exact Delays.- Bidding to the Top: VCG and Equilibria of Position-Based Auctions.- Coping with Interference: From Maximum Coverage to Planning Cellular Networks.- Online Dynamic Programming Speedups.- Covering Many or Few Points with Unit Disks.- On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems.- Online k-Server Routing Problems.- Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem.- Improved Approximation Bounds for Edge Dominating Set in Dense Graphs.- A Randomized Algorithm for Online Unit Clustering.- On Hierarchical Diameter-Clustering, and the Supplier Problem.- Bin Packing with Rejection Revisited.- On Bin Packing with Conflicts.- Approximate Distance Queries in Disk Graphs.- Network Design with Edge-Connectivity and Degree Constraints.- Approximating Maximum Cut with Limited Unbalance.- Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems.- Improved Online Hypercube Packing.- Competitive Online Multicommodity Routing.- The k-Allocation Problem and Its Variants.- An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions.- Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set.- Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search.- Approximation Algorithms for Multi-criteria Traveling Salesman Problems.- The Survival of the Weakest in Networks.- Online Distributed Object Migration.