Advertisement

Approximation and Online Algorithms

9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers

  • Roberto Solis-Oba
  • Giuseppe Persiano
Conference proceedings WAOA 2011

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

Table of contents

  1. Front Matter
  2. Sebastián Marbán, Cyriel Rutten, Tjark Vredeveld
    Pages 21-34
  3. Wolfgang Bein, Naoki Hatta, Nelson Hernandez-Cons, Hiro Ito, Shoji Kasahara, Jun Kawahara
    Pages 35-48
  4. Cristina Bazgan, Laurent Gourvès, Jérôme Monnot, Fanny Pascual
    Pages 49-62
  5. Ljiljana Brankovic, Henning Fernau
    Pages 63-76
  6. Nadine Schwartges, Joachim Spoerhase, Alexander Wolff
    Pages 77-88
  7. Kai-Simon Goetzmann, Sebastian Stiller, Claudio Telha
    Pages 89-101
  8. Klaus Jansen, Christina Robenek
    Pages 109-122
  9. Jianqiao Zhu, Ho-Leung Chan, Tak-Wah Lam
    Pages 137-149
  10. Reza Dorrigiv, Alejandro López-Ortiz
    Pages 150-163
  11. Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu
    Pages 164-175
  12. Anke van Zuylen
    Pages 188-197
  13. Marc P. Renault, Adi Rosén
    Pages 198-210
  14. Rolf Harren, Walter Kern
    Pages 211-218
  15. Yishay Mansour, Boaz Patt-Shamir, Dror Rawitz
    Pages 219-232
  16. Cristina Bazgan, Laurent Gourvès, Jérôme Monnot
    Pages 233-246
  17. Martin Groß, Martin Skutella
    Pages 247-260
  18. Ruben Hoeksma, Marc Uetz
    Pages 261-273
  19. Back Matter

About these proceedings

Introduction

This book constitutes the thoroughly refereed post-proceedings of the 9th International Workshop on Approximation and Online Algorithms, WAOA 2011, held in Saarbrücken, Germany, in September 2011.
The 21 papers presented were carefully reviewed and selected from 48 submissions. The volume also contains an extended abstract of the invited talk of Prof. Klaus Jansen.

The Workshop on Approximation and Online Algorithms focuses on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications
in a wide variety of fields. Topics of interest for WAOA 2011 were: algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, parameterized complexity, randomization techniques and scheduling problems.

Keywords

approximation algorithms competitive analysis game theory robust optimization

Editors and affiliations

  • Roberto Solis-Oba
    • 1
  • Giuseppe Persiano
    • 2
  1. 1.Department of Computer ScienceThe University of Western OntarioLondonCanada
  2. 2.Dipartimento di Informatica "Renato M. Capocelli"Università di SalernoFiscianoItaly

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-29116-6
  • Copyright Information Springer-Verlag Berlin Heidelberg 2012
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-29115-9
  • Online ISBN 978-3-642-29116-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site