5. WAOA 2007:
Eilat,
Israel
Christos Kaklamanis, Martin Skutella (Eds.):
Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers.
Lecture Notes in Computer Science 4927 Springer 2008, ISBN 978-3-540-77917-9 
- Robert Krauthgamer, Aranyak Mehta, Atri Rudra:
Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations.
1-14
- Iftah Gamzu:
Improved Lower Bounds for Non-utilitarian Truthfulness.
15-26
- Nedialko B. Dimitrov, C. Greg Plaxton:
Buyer-Supplier Games: Optimization over the Core.
27-40
- Tobias Brüggemann, Johann Hurink, Tjark Vredeveld, Gerhard J. Woeginger:
Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines.
41-54
- Alexander A. Ageev:
A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays.
55-66
- Johann Hurink, Jacob Jan Paulus:
Online Algorithm for Parallel Job Scheduling and Strip Packing.
67-74
- Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
Geometric Spanners with Small Chromatic Number.
75-88
- Maarten Löffler, Marc J. van Kreveld:
Approximating Largest Convex Hulls for Imprecise Points.
89-102
- Alexander A. Ageev, Artem V. Pyatkin:
A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem.
103-115
- Dorit S. Hochbaum, Asaf Levin:
Covering the Edges of Bipartite Graphs Using K 2, 2 Graphs.
116-127
- Amitai Armon:
On Min-Max r -Gatherings.
128-141
- Leah Epstein, Asaf Levin:
On the Max Coloring Problem.
142-155
- Panagiota N. Panagopoulou, Paul G. Spirakis:
Full and Local Information in Distributed Decision Making.
156-169
- Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette:
The Minimum Substring Cover Problem.
170-183
- José R. Correa, Cristina G. Fernandes, Martín Matamala, Yoshiko Wakabayashi:
A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs.
184-192
- Leah Epstein, Rob van Stee:
On the Online Unit Clustering Problem.
193-206
- Marek Chrobak, Mathilde Hurand:
Better Bounds for Incremental Medians.
207-217
- Leah Epstein, Asaf Levin:
Minimum Weighted Sum Bin Packing.
218-231
- Leah Epstein, Rob van Stee:
Approximation Schemes for Packing Splittable Items with Cardinality Constraints.
232-245
- Wolfgang W. Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec:
A Randomized Algorithm for Two Servers in Cross Polytope Spaces.
246-259
- Anke van Zuylen, David P. Williamson:
Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems.
260-273
- Haitao Wang, Amitabh Chaudhary, Danny Z. Chen:
Online Rectangle Filling.
274-287
Last update Wed Feb 15 05:21:14 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
