Approximation and Online Algorithms

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

  • Evripidis Bampis
  • Ola Svensson
Conference proceedings WAOA 2014

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

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 8952)

Table of contents

  1. Front Matter
    Pages I-X
  2. Alexander Ageev, Alexander Kononov
    Pages 1-10
  3. Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Michele Scquizzato
    Pages 11-22
  4. Martin Böhm, Jiří Sgall, Rob van Stee, Pavel Veselý
    Pages 23-34
  5. Martin Böhm, Jiří Sgall, Pavel Veselý
    Pages 35-46
  6. Marie G. Christ, Lene M. Favrholdt, Kim S. Larsen
    Pages 83-94
  7. Vincent Cohen-Addad, Zhentao Li, Claire Mathieu, Ioannis Milis
    Pages 107-118
  8. J. Czyzowicz, E. Kranakis, D. Krizanc, L. Narayanan, J. Opatrny
    Pages 119-131
  9. Guilherme D. da Fonseca, Vinícius G. Pereira de Sá, Celina M. H. de Figueiredo
    Pages 132-143
  10. Yann Disser, Stefan Kratsch, Manuel Sorge
    Pages 144-155
  11. Wolfgang Dvořák, Monika Henzinger
    Pages 156-167
  12. Martina Eikel, Christian Scheideler, Alexander Setzer
    Pages 168-180
  13. Lene M. Favrholdt, Jesper W. Mikkelsen
    Pages 181-192
  14. Tomasz Jurdzinski, Dariusz R. Kowalski, Krzysztof Lorys
    Pages 193-206
  15. Rudolf Scheifele
    Pages 224-235
  16. Martijn van Ee, René Sitters
    Pages 248-259
  17. Andreas Wierz, Britta Peis, S. Thomas McCormick
    Pages 260-272
  18. Back Matter
    Pages 273-273

About these proceedings


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.


Approximation algorithms Coloring Competitive analysis Connectivity Design and analysis of algorithms Geometric problems Graph algorithms analysis Graph drawing Network design Online algorithms Online problems Operations research Packing and covering Parameterized complexity Partitioning Randomization techniques Scheduling problems

Editors and affiliations

  • Evripidis Bampis
    • 1
  • Ola Svensson
    • 2
  1. 1.Université Pierre et Marie Curie, LIP6ParisFrance
  2. 2.EPFL-ICLausanneSwitzerland

Bibliographic information

  • DOI
  • Copyright Information Springer International Publishing Switzerland 2015
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science Computer Science (R0)
  • Print ISBN 978-3-319-18262-9
  • Online ISBN 978-3-319-18263-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Materials & Steel
Finance, Business & Banking
IT & Software
Consumer Packaged Goods
Energy, Utilities & Environment