Approximation and Online Algorithms: 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007, Revised Papers

by Kaklamanis, Christos; Skutella, Martin

• ISBN13: 9783540779179
• ISBN10: 3540779175
• Format: Paperback
• Copyright: 2008-04-03
• Publisher: Springer Verlag

Summary

This book constitutes the thoroughly refereed post workshop proceedings of the 5th International Workshop on Approximation and Online Algorithms, WAOA 2007, held in Eilat, Israel, in October 2007 as part of the ALGO 2007 conference event. The 22 revised full papers presented were carefully reviewed and selected from 56 submissions. The workshop covered areas such as algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real-world applications, and scheduling problems.

Table of Contents

Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations	p. 1
Improved Lower Bounds for Non-utilitarian Truthfulness	p. 15
Buyer-Supplier Games: Optimization over the Core	p. 27
Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines	p. 41
A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays	p. 55
Online Algorithm for Parallel Job Scheduling and Strip Packing	p. 69
Geometric Spanners with Small Chromatic Number	p. 75
Approximating Largest Convex Hulls for Imprecise Points	p. 89
A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem	p. 103
Covering the Edges of Bipartite Graphs Using K[subscript 2,2] Graphs	p. 116
On Min-Max r-Gatherings	p. 128
On the Max Coloring Problem	p. 142
Full and Local Information in Distributed Decision Making	p. 156
The Minimum Substring Cover Problem	p. 170
A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs	p. 184
On the Online Unit Clustering Problem	p. 193
Better Bounds for Incremental Medians	p. 207
Minimum Weighted Sum Bin Packing	p. 218
Approximation Schemes for Packing Splittable Items with Cardinality Constraints	p. 232
A Randomized Algorithm for Two Servers in Cross Polytope Spaces	p. 246
Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems	p. 260
Online Rectangle Filling	p. 274
Author Index	p. 289
Table of Contents provided by Blackwell. All Rights Reserved.