Approximation and Online Algorithms 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers

Corporate Author: SpringerLink (Online service)
Other Authors: Erlebach, Thomas (Editor), Kaklamanis, Christos (Editor)
Format: eBook
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2007, 2007
Edition:1st ed. 2007
Series:Theoretical Computer Science and General Issues
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
Table of Contents:
  • VCG and Equilibria of Position-Based Auctions
  • Coping with Interference: From Maximum Coverage to Planning Cellular Networks
  • Online Dynamic Programming Speedups
  • Covering Many or Few Points with Unit Disks
  • On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems
  • Online k-Server Routing Problems
  • Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem
  • Improved Approximation Bounds for Edge Dominating Set in Dense Graphs
  • A Randomized Algorithm for Online Unit Clustering
  • On Hierarchical Diameter-Clustering, and the Supplier Problem
  • Bin Packing with Rejection Revisited
  • On Bin Packing with Conflicts
  • Approximate Distance Queries in Disk Graphs
  • Network Design with Edge-Connectivity and Degree Constraints
  • Approximating Maximum Cut with Limited Unbalance
  • Worst Case Analysis of Max-Regret, Greedy and Other Heur