Skip to main content
  • Conference proceedings
  • © 2010

Approximation and Online Algorithms

7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009 Revised Papers

  • Up-to-date results

  • Fast track conference proceeding

  • State-of-the-art report

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 5893)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): WAOA: International Workshop on Approximation and Online Algorithms

Conference proceedings info: WAOA 2009.

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (22 papers)

  1. Front Matter

  2. WAOA 2009

    1. Price Fluctuations: To Buy or to Rent

      • Marcin Bienkowski
      Pages 25-36
    2. Approximation Algorithms for Multiple Strip Packing

      • Marin Bougeret, Pierre Francois Dutot, Klaus Jansen, Christina Otte, Denis Trystram
      Pages 37-48
    3. Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window

      • Ho-Leung Chan, Tak-Wah Lam, Lap-Kei Lee, Hing-Fung Ting
      Pages 49-61
    4. Longest Wait First for Broadcast Scheduling [Extended Abstract]

      • Chandra Chekuri, Sungjin Im, Benjamin Moseley
      Pages 62-74
    5. The Routing Open Shop Problem: New Approximation Algorithms

      • Ilya Chernykh, Nikita Dryuck, Alexander Kononov, Sergey Sevastyanov
      Pages 75-85
    6. On the Price of Stability for Undirected Network Design

      • George Christodoulou, Christine Chung, Katrina Ligett, Evangelia Pyrga, Rob van Stee
      Pages 86-97
    7. Finding Dense Subgraphs in G(n,1/2)

      • Atish Das Sarma, Amit Deshpande, Ravi Kannan
      Pages 98-103
    8. Parameterized Analysis of Paging and List Update Algorithms

      • Reza Dorrigiv, Martin R. Ehmsen, Alejandro López-Ortiz
      Pages 104-115
    9. Online Scheduling of Bounded Length Jobs to Maximize Throughput

      • Christoph Dürr, Łukasz Jeż, Kim Thang Nguyen
      Pages 116-127
    10. On the Additive Constant of the k-Server Work Function Algorithm

      • Yuval Emek, Pierre Fraigniaud, Amos Korman, Adi Rosén
      Pages 128-134
    11. Guard Games on Graphs: Keep the Intruder Out!

      • Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov
      Pages 147-158
    12. Between a Rock and a Hard Place: The Two-to-One Assignment Problem

      • Dries Goossens, Sergey Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger
      Pages 159-169
    13. Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width

      • Elisabeth Günther, Felix G. König, Nicole Megow
      Pages 170-181
    14. Online Minimization Knapsack Problem

      • Xin Han, Kazuhisa Makino
      Pages 182-193
    15. Optimization Problems in Multiple Subtree Graphs

      • Danny Hermelin, Dror Rawitz
      Pages 194-204
    16. Multi-Criteria TSP: Min and Max Combined

      • Bodo Manthey
      Pages 205-216

Other Volumes

  1. Approximation and Online Algorithms

Keywords

  • Partition
  • algorithm analysis
  • algorithm design
  • algorithmic game theory
  • algorithmic graph theory
  • algorithmics
  • algorithms
  • approximation
  • complexity
  • scheduling
  • algorithm analysis and problem complexity

Editors and Affiliations

  • IBISC, CNRS FRE 3190, Université d’Evry Val d’Essonne, Evry Cedex, France

    Evripidis Bampis

  • Institute for Computer Science and Applied Mathematics, University of Kiel, Kiel, Germany

    Klaus Jansen

Bibliographic Information

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions