Skip to main content
  • Conference proceedings
  • © 2017

Approximation and Online Algorithms

14th International Workshop, WAOA 2016, Aarhus, Denmark, August 25–26, 2016, Revised Selected Papers

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

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 2016.

Buy it now

Buying options

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

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (16 papers)

  1. Front Matter

    Pages I-XIV
  2. The Shortest Separating Cycle Problem

    • Esther M. Arkin, Jie Gao, Adam Hesterberg, Joseph S. B. Mitchell, Jiemin Zeng
    Pages 1-13
  3. A PTAS for the Cluster Editing Problem on Planar Graphs

    • André Berger, Alexander Grigoriev, Andrej Winokurow
    Pages 27-39
  4. Bin Packing with Colocations

    • Jean-Claude Bermond, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, Stéphane Pérennes et al.
    Pages 40-51
  5. Batch Coloring of Graphs

    • Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
    Pages 52-64
  6. New Integrality Gap Results for the Firefighters Problem on Trees

    • Parinya Chalermsook, Daniel Vaz
    Pages 65-77
  7. Balanced Optimization with Vector Costs

    • Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger
    Pages 92-102
  8. Vertex Sparsification in Trees

    • Gramoz Goranci, Harald Räcke
    Pages 103-115
  9. Scenario Submodular Cover

    • Nathaniel Grammel, Lisa Hellerstein, Devorah Kletenik, Patrick Lin
    Pages 116-128
  10. A Refined Analysis of Online Path Coloring in Trees

    • Astha Chauhan, N. S. Narayanaswamy
    Pages 142-154
  11. Resource Allocation Games with Multiple Resource Classes

    • Roy B. Ofer, Tami Tamir
    Pages 155-169
  12. Tight Approximation Bounds for the Seminar Assignment Problem

    • Amotz Bar-Noy, George Rabanca
    Pages 170-182
  13. A priori TSP in the Scenario Model

    • Martijn van Ee, Leo van Iersel, Teun Janssen, René Sitters
    Pages 183-196
  14. Back Matter

    Pages 211-211

Other Volumes

  1. Approximation and Online Algorithms

About this book

This book constitutes the thoroughly refereed post-workshop proceedings of the 14th International Workshop on Approximation and Online Algorithms, WAOA 2016, held in Aarhus, Denmark, in August 2016 as part of ALGO 2016. 
The 16 revised full papers presented together with 2 invited lectures were carefully reviewed and selected from 33 submissions. Topics of interest for WAOA 2016 were: coloring and partitioning, competitive analysis, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real world applications, and scheduling problems.

Editors and Affiliations

  • Institut für Informatik, Christian-Albrechts-Universität, Kiel, Germany

    Klaus Jansen

  • Istituto Dalle Molle di Studi sull’ Intelligenza Artificiale, Manno (Lugano), Switzerland

    Monaldo Mastrolilli

Bibliographic Information

Buy it now

Buying options

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

Tax calculation will be finalised at checkout

Other ways to access