4. WAOA 2006: Zurich, Switzerland

• Alexander A. Ageev, Alexander V. Kononov:
  Approximation Algorithms for Scheduling Problems with Exact Delays. 1-14
  
• Gagan Aggarwal, Jon Feldman, S. Muthukrishnan:
  Bidding to the Top: VCG and Equilibria of Position-Based Auctions. 15-28
  
• David Amzallag, Joseph Naor, Danny Raz:
  Coping with Interference: From Maximum Coverage to Planning Cellular Networks. 29-42
  
• Amotz Bar-Noy, Mordecai J. Golin, Yan Zhang:
  Online Dynamic Programming Speedups. 43-54
  
• Mark de Berg, Sergio Cabello, Sariel Har-Peled:
  Covering Many or Few Points with Unit Disks. 55-68
  
• 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
  
• Vincenzo Bonifaci, Leen Stougie:
  Online k-Server Routing Problems. 83-94
  
• Joan Boyar, Martin R. Ehmsen, Kim S. Larsen:
  Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem. 95-107
  
• Jean Cardinal, Stefan Langerman, Eythan Levy:
  Improved Approximation Bounds for Edge Dominating Set in Dense Graphs. 108-120
  
• Timothy M. Chan, Hamid Zarrabi-Zadeh:
  A Randomized Algorithm for Online Unit Clustering. 121-131
  
• Aparna Das, Claire Kenyon:
  On Hierarchical Diameter-Clustering, and the Supplier Problem. 132-145
  
• Leah Epstein:
  Bin Packing with Rejection Revisited. 146-159
  
• Leah Epstein, Asaf Levin:
  On Bin Packing with Conflicts. 160-173
  
• Martin Fürer, Shiva Prasad Kasiviswanathan:
  Approximate Distance Queries in Disk Graphs. 174-187
  
• Takuro Fukunaga, Hiroshi Nagamochi:
  Network Design with Edge-Connectivity and Degree Constraints. 188-201
  
• Giulia Galbiati, Francesco Maffioli:
  Approximating Maximum Cut with Limited Unbalance. 202-213
  
• 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
  
• Xin Han, Deshi Ye, Yong Zhou:
  Improved Online Hypercube Packing. 226-239
  
• Tobias Harks, Stefan Heinz, Marc E. Pfetsch:
  Competitive Online Multicommodity Routing. 240-252
  
• Dorit S. Hochbaum, Asaf Levin:
  The k-Allocation Problem and Its Variants. 253-264
  
• Jörg Knoche, Piotr Krysta:
  An Experimental Study of the Misdirection Algorithm for Combinatorial Auctions. 265-278
  
• Petr Kolman, Tomasz Walen:
  Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set. 279-289
  
• Asaf Levin:
  Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search. 290-301
  
• Bodo Manthey, L. Shankar Ram:
  Approximation Algorithms for Multi-criteria Traveling Salesman Problems. 302-315
  
• Sotiris E. Nikoletseas, Christoforos Raptopoulos, Paul G. Spirakis:
  The Survival of the Weakest in Networks. 316-329
  
• David Scot Taylor:
  Online Distributed Object Migration. 330-344