Approximation and Online Algorithms

8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised Papers

  • Klaus Jansen
  • Roberto Solis-Oba
Conference proceedings WAOA 2010

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

Table of contents

  1. Front Matter
  2. WAOA 2010

    1. Elliot Anshelevich, Bugra Caskurlu, Ameya Hate
      Pages 1-12
    2. Spyridon Antonakopoulos
      Pages 13-24
    3. János Balogh, József Békési, Gábor Galambos
      Pages 25-36
    4. Magnus Bordewich
      Pages 37-46
    5. Patrick Briest, Heiko Röglin
      Pages 47-58
    6. Ho-Leung Chan, Tak-Wah Lam, Rongbin Li
      Pages 59-70
    7. Chandra Chekuri, Avigdor Gal, Sungjin Im, Samir Khuller, Jian Li, Richard McCutchen et al.
      Pages 71-82
    8. Danny Z. Chen, Rudolf Fleischer, Jian Li
      Pages 83-93
    9. Aparna Das, Claire Mathieu, Shay Mozes
      Pages 94-105
    10. Daniel Dressler, Martin Skutella
      Pages 106-117
    11. Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen
      Pages 118-129
    12. Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos
      Pages 130-141
    13. Caroline Jagtenberg, Uwe Schwiegelshohn, Marc Uetz
      Pages 142-153
    14. Tak-Wah Lam, Chi-Man Liu, Hing-Fung Ting
      Pages 178-189
    15. Konstantin Makarychev, Yury Makarychev
      Pages 190-200
    16. Claire Mathieu, Adrian Vladu
      Pages 201-212

About these proceedings

Introduction

This book constitutes the thoroughly refereed post workshop proceedings of the 8th International Workshop on Approximation and Online Algorithms, WAOA 2010, held in Liverpool, UK, in September 2010 as part of the ALGO 2010 conference event.

The 23 revised full papers presented were carefully reviewed and
selected from 58 submissions. The workshop covered areas such as
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, real-world applications, and scheduling problems.

Keywords

algorithm analysis algorithm design algorithmic graph theory approximation algorithm chordal graph combinatorial optimization competitive analysis complexity disk graph domination search dynamic flow edge-connectivity efficiency exponential distribution game theory graph algorithms graph minors graphs inapproximability intersection graph interval graph linear programs matching problem network design network flow node-connectivity online algorithms planar graph precedence constraints randomized algorithms scheduling sensor network set cover stochastic scheduling unit disk graph

Editors and affiliations

  • Klaus Jansen
    • 1
  • Roberto Solis-Oba
    • 2
  1. 1.Department of Computer ScienceUniversity of KielKielGermany
  2. 2.Department of Computer ScienceThe University of Western OntarioLondonCanada

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-18318-8
  • Copyright Information Springer Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-18317-1
  • Online ISBN 978-3-642-18318-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book
Industry Sectors
Electronics
Telecommunications
Energy, Utilities & Environment
Biotechnology