4. WAOA 2006:
Zurich,
Switzerland
Thomas Erlebach, Christos Kaklamanis (Eds.):
Approximation and Online Algorithms, 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers.
Lecture Notes in Computer Science 4368 Springer 2006, ISBN 3-540-69513-3 BibTeX
- Alexander A. Ageev, Alexander V. Kononov:
Approximation Algorithms for Scheduling Problems with Exact Delays.
1-14
Electronic Edition (link) BibTeX
- Gagan Aggarwal, Jon Feldman, S. Muthukrishnan:
Bidding to the Top: VCG and Equilibria of Position-Based Auctions.
15-28
Electronic Edition (link) BibTeX
- David Amzallag, Joseph Naor, Danny Raz:
Coping with Interference: From Maximum Coverage to Planning Cellular Networks.
29-42
Electronic Edition (link) BibTeX
- Amotz Bar-Noy, Mordecai J. Golin, Yan Zhang:
Online Dynamic Programming Speedups.
43-54
Electronic Edition (link) BibTeX
- Mark de Berg, Sergio Cabello, Sariel Har-Peled:
Covering Many or Few Points with Unit Disks.
55-68
Electronic Edition (link) BibTeX
- Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle:
On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems.
69-82
Electronic Edition (link) BibTeX
- Vincenzo Bonifaci, Leen Stougie:
Online k-Server Routing Problems.
83-94
Electronic Edition (link) BibTeX
- Joan Boyar, Martin R. Ehmsen, Kim S. Larsen:
Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem.
95-107
Electronic Edition (link) BibTeX
- Jean Cardinal, Stefan Langerman, Eythan Levy:
Improved Approximation Bounds for Edge Dominating Set in Dense Graphs.
108-120
Electronic Edition (link) BibTeX
- Timothy M. Chan, Hamid Zarrabi-Zadeh:
A Randomized Algorithm for Online Unit Clustering.
121-131
Electronic Edition (link) BibTeX
- Aparna Das, Claire Kenyon:
On Hierarchical Diameter-Clustering, and the Supplier Problem.
132-145
Electronic Edition (link) BibTeX
- Leah Epstein:
Bin Packing with Rejection Revisited.
146-159
Electronic Edition (link) BibTeX
- Leah Epstein, Asaf Levin:
On Bin Packing with Conflicts.
160-173
Electronic Edition (link) BibTeX
- Martin Fürer, Shiva Prasad Kasiviswanathan:
Approximate Distance Queries in Disk Graphs.
174-187
Electronic Edition (link) BibTeX
- Takuro Fukunaga, Hiroshi Nagamochi:
Network Design with Edge-Connectivity and Degree Constraints.
188-201
Electronic Edition (link) BibTeX
- Giulia Galbiati, Francesco Maffioli:
Approximating Maximum Cut with Limited Unbalance.
202-213
Electronic Edition (link) BibTeX
- Gregory Gutin, Boris Goldengorin, Jing Huang:
Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems.
214-225
Electronic Edition (link) BibTeX
- Xin Han, Deshi Ye, Yong Zhou:
Improved Online Hypercube Packing.
226-239
Electronic Edition (link) BibTeX
- Tobias Harks, Stefan Heinz, Marc E. Pfetsch:
Competitive Online Multicommodity Routing.
240-252
Electronic Edition (link) BibTeX
- Dorit S. Hochbaum, Asaf Levin:
The k-Allocation Problem and Its Variants.
253-264
Electronic Edition (link) BibTeX
- Jörg Knoche, Piotr Krysta:
An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions.
265-278
Electronic Edition (link) BibTeX
- Petr Kolman, Tomasz Walen:
Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set.
279-289
Electronic Edition (link) BibTeX
- Asaf Levin:
Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search.
290-301
Electronic Edition (link) BibTeX
- Bodo Manthey, L. Shankar Ram:
Approximation Algorithms for Multi-criteria Traveling Salesman Problems.
302-315
Electronic Edition (link) BibTeX
- Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis:
The Survival of the Weakest in Networks.
316-329
Electronic Edition (link) BibTeX
- David Scot Taylor:
Online Distributed Object Migration.
330-344
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:47:17 2009
by Michael Ley (ley@uni-trier.de)
