Approximation and Online Algorithms

11th International Workshop, WAOA 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers

  • Christos Kaklamanis
  • Kirk Pruhs
Conference proceedings WAOA 2013

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

Table of contents

  1. Front Matter
  2. Trevor Fenner, Oded Lachish, Alexandru Popa
    Pages 1-11
  3. Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono
    Pages 24-36
  4. Nicolas Boria, Federico Della Croce, Vangelis Th. Paschos
    Pages 37-48
  5. MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz, Zeev Nutov
    Pages 49-60
  6. Ulrich Pferschy, Joachim Schauer
    Pages 61-72
  7. Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau
    Pages 73-84
  8. Erika M. M. Coelho, Mitre C. Dourado, Rudini M. Sampaio
    Pages 97-107
  9. Hemant Tyagi, Bernd Gärtner
    Pages 108-119
  10. Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul
    Pages 120-131
  11. Anna Adamaszek, Marc P. Renault, Adi Rosén, Rob van Stee
    Pages 132-143
  12. Marek Cygan, Łukasz Jeż
    Pages 144-155
  13. Matúš Mihalák, Rastislav Šrámek, Peter Widmayer
    Pages 156-167
  14. Back Matter

About these proceedings


This book constitutes the thoroughly refereed workshop proceedings of the 11th International Workshop on Approximation and Online Algorithms, WAOA 2013, held in Sophia Antipolis, France, in September 2013 as part of the ALGO 2013 conference event. The 14 revised full papers presented were carefully reviewed and selected from 33 submissions. They focus on the design and analysis of algorithms for online and computationally hard problems, for example in algorithmic game theory, algorithmic trading, coloring and partitioning, competitive analysis, computational advertising, computational finance, cuts and connectivity, geometric problems, graph algorithms, inapproximability results, mechanism design, natural algorithms, network design, packing and covering, paradigms for the design and analysis of approximation and online algorithms, parameterized complexity, real-world applications, scheduling problems.


algorithmic game theory algorithmic trading approximation algorithms coloring competitive analysis

Editors and affiliations

  • Christos Kaklamanis
    • 1
  • Kirk Pruhs
    • 2
  1. 1.Computer Technology Institute and Press “Diophantus” & Department of Computer Engineering and InformaticsUniversity of PatrasRioGreece
  2. 2.University of PittsburghPittsburghUSA

Bibliographic information

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