Skip to main content
SpringerLink
Log in

Approximation and Online Algorithms

12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised Selected Papers

  • Conference proceedings
  • © 2015

Overview

Editors:
  1. Evripidis Bampis

    1. Université Pierre et Marie Curie, LIP6, Paris, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Ola Svensson

    1. EPFL-IC, Lausanne, Switzerland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Included in the following conference series:

Conference proceedings info: WAOA 2014.

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (22 papers)

  1. Front Matter

    Pages I-X
    Download chapter PDF

  2. Improved Approximations for the Max k-Colored Clustering Problem

    • Alexander Ageev, Alexander Kononov
    Pages 1-10

  3. A \(o(n)\)-Competitive Deterministic Algorithm for Online Matching on a Line

    • Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato
    Pages 11-22

  4. Better Algorithms for Online Bin Stretching

    • Martin Böhm, Jiří Sgall, Rob van Stee, Pavel Veselý
    Pages 23-34

  5. Online Colored Bin Packing

    • Martin Böhm, Jiří Sgall, Pavel Veselý
    Pages 35-46

  6. Improved Bound for Online Square-into-Square Packing

    • Brian Brubach
    Pages 47-58

  7. Improved Approximation Algorithm for Fault-Tolerant Facility Placement

    • Bartosz Rybicki, Jaroslaw Byrka
    Pages 59-70

  8. The Submodular Facility Location Problem and the Submodular Joint Replenishment Problem

    • Sin-Shuen Cheung
    Pages 71-82

  9. Online Multi-Coloring with Advice

    • Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
    Pages 83-94

  10. Approximating Steiner Trees and Forests with Minimum Number of Steiner Points

    • Nachshon Cohen, Zeev Nutov
    Pages 95-106

  11. Energy-Efficient Algorithms for Non-preemptive Speed-Scaling

    • Vincent Cohen-Addad, Zhentao Li, Claire Mathieu, Ioannis Milis
    Pages 107-118

  12. Optimal Online and Offline Algorithms for Robot-Assisted Restoration of Barrier Coverage

    • J. Czyzowicz, E. Kranakis, D. Krizanc, L. Narayanan, J. Opatrny
    Pages 119-131

  13. Linear-Time Approximation Algorithms for Unit Disk Graphs

    • Guilherme D. da Fonseca, Vinícius G. Pereira de Sá, Celina M. H. de Figueiredo
    Pages 132-143

  14. The Minimum Feasible Tileset Problem

    • Yann Disser, Stefan Kratsch, Manuel Sorge
    Pages 144-155

  15. Online Ad Assignment with an Ad Exchange

    • Wolfgang Dvořák, Monika Henzinger
    Pages 156-167

  16. Minimum Linear Arrangement of Series-Parallel Graphs

    • Martina Eikel, Christian Scheideler, Alexander Setzer
    Pages 168-180

  17. Online Dual Edge Coloring of Paths and Trees

    • Lene M. Favrholdt, Jesper W. Mikkelsen
    Pages 181-192

  18. Online Packet Scheduling Under Adversarial Jamming

    • Tomasz Jurdzinski, Dariusz R. Kowalski, Krzysztof Lorys
    Pages 193-206

  19. Generalized Hypergraph Matching via Iterated Packing and Local Ratio

    • Ojas Parekh, David Pritchard
    Pages 207-223

  20. Steiner Trees with Bounded RC-Delay

    • Rudolf Scheifele
    Pages 224-235
Back to top

Other volumes

  1. Approximation and Online Algorithms

Keywords

About this book

This book constitutes the thoroughly refereed post-workshop proceedings of the 12th International Workshop on Approximation and Online Algorithms, WAOA 2014, held in Wrocław, Poland, in September 2014 as part of ALGO 2014.

The 22 revised full papers presented were carefully reviewed and selected from 49 submissions. They cover a wide range of topics such as 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

  • Université Pierre et Marie Curie, LIP6, Paris, France

    Evripidis Bampis

  • EPFL-IC, Lausanne, Switzerland

    Ola Svensson

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation