Approximation and Online Algorithms 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 Revised Papers

Corporate Author: SpringerLink (Online service)
Other Authors: Bampis, Evripidis (Editor), Jansen, Klaus (Editor)
Format: eBook
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2010, 2010
Edition:1st ed. 2010
Series:Theoretical Computer Science and General Issues
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
Table of Contents:
  • To Buy or to Rent
  • Approximation Algorithms for Multiple Strip Packing
  • Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window
  • Longest Wait First for Broadcast Scheduling [Extended Abstract]
  • The Routing Open Shop Problem: New Approximation Algorithms
  • On the Price of Stability for Undirected Network Design
  • Finding Dense Subgraphs in G(n,1/2)
  • Parameterized Analysis of Paging and List Update Algorithms
  • Online Scheduling of Bounded Length Jobs to Maximize Throughput
  • On the Additive Constant of the k-Server Work Function Algorithm
  • A (4?+??)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs
  • Guard Games on Graphs: Keep the Intruder Out!
  • Between a Rock and a Hard Place: The Two-to-One Assignm