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

Robert Krauthgamer, Aranyak Mehta, Atri Rudra (auth.), Christos Kaklamanis, Martin Skutella (eds.)3540779175, 9783540779179

The Fifth Workshop on Approximation and Online Algorithms (WAOA 2007) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications from a variety of ?elds. WAOA 2007 took place in Eilat, Israel, during October 11–12, 2007. The workshop was part of the ALGO 2007 event that also hosted ESA 2007, and PEGG 2007. The previous WAOA workshops were held in Budapest (2003), Rome (2004), Palma de Mallorca (2005) and Zurich (2006). The proceedings of these previous WAOA workshops have appeared as LNCS volumes 2909, 3351, 3879 and 4368, respectively. Topics of interest for WAOA 2007 were: algorithmic game theory, appro- mation classes, coloring and partitioning, competitive analysis, computational ?nance, 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. In response to the call for – pers, we received 56 submissions. Each submission was reviewed by at least three referees, and the vast majority by at least four referees. The submissions were mainly judged on originality, technical quality, and relevance to the topics of the conference. Based on the reviews, the Program Committee selected 22 papers. We are grateful to Andrei Voronkov for providing the EasyChair conference system which was used to manage the electronic submissions, the review process, and the electronic PC meeting. It made our task much easier.

---

Table of contents :
Front Matter….Pages –
Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations….Pages 1-14
Improved Lower Bounds for Non-utilitarian Truthfulness….Pages 15-26
Buyer-Supplier Games: Optimization over the Core….Pages 27-40
Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines….Pages 41-54
A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays….Pages 55-66
Online Algorithm for Parallel Job Scheduling and Strip Packing….Pages 67-74
Geometric Spanners with Small Chromatic Number….Pages 75-88
Approximating Largest Convex Hulls for Imprecise Points….Pages 89-102
A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem….Pages 103-115
Covering the Edges of Bipartite Graphs Using K 2,2 Graphs….Pages 116-127
On Min-Max r -Gatherings….Pages 128-141
On the Max Coloring Problem….Pages 142-155
Full and Local Information in Distributed Decision Making….Pages 156-169
The Minimum Substring Cover Problem….Pages 170-183
A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs….Pages 184-192
On the Online Unit Clustering Problem….Pages 193-206
Better Bounds for Incremental Medians….Pages 207-217
Minimum Weighted Sum Bin Packing….Pages 218-231
Approximation Schemes for Packing Splittable Items with Cardinality Constraints….Pages 232-245
A Randomized Algorithm for Two Servers in Cross Polytope Spaces….Pages 246-259
Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems….Pages 260-273
Online Rectangle Filling….Pages 274-287
Back Matter….Pages –