Approximation and Online Algorithms

6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers

  • Evripidis Bampis
  • Martin Skutella
Conference proceedings WAOA 2008

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

Table of contents

  1. Front Matter
  2. WAOA 2008

    1. Jochen Könemann, Ojas Parekh, David Pritchard
      Pages 1-14
    2. Péter Biró, David F. Manlove, Shubham Mittal
      Pages 15-28
    3. Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh
      Pages 29-42
    4. Stanley P. Y. Fung, Chung Keung Poon, Feifeng Zheng
      Pages 53-66
    5. Laurent Gourvès, Jérôme Monnot, Fanny Pascual
      Pages 78-91
    6. Marcin Bienkowski, Marek Chrobak, Łukasz Jeż
      Pages 92-104
    7. Martin Gairing
      Pages 119-132
    8. Amotz Bar-Noy, Matthew P. Johnson, Ou Liu
      Pages 147-159
    9. Ariel Kulik, Hadas Shachnai
      Pages 160-173
    10. Chandrashekhar Nagarajan, Yogeshwer Sharma, David P. Williamson
      Pages 174-187
    11. Leah Epstein, Amos Fiat, Meital Levy
      Pages 188-200
    12. Davide Bilò, Peter Widmayer, Anna Zych
      Pages 201-213
    13. Chris Gray, Maarten Löffler, Rodrigo I. Silveira
      Pages 214-226
    14. Joseph Wun-Tat Chan, Francis Y. L. Chin, Xiangyu Hong, Hing Fung Ting
      Pages 241-252

About these proceedings

Introduction

This book constitutes the thoroughly refereed post workshop proceedings of the 6th International Workshop on Approximation and Online Algorithms, WAOA 2008, held in Karlsruhe, Germany, in September 2008 as part of the ALGO 2008 conference event.

The 22 revised full papers presented were carefully reviewed and selected from 56 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, randomization techniques, real-world applications, and scheduling problems.

Keywords

Approximation Partition algorithm analysis algorithm design algorithmic game theory algorithmics algorithms approximation algorithms assignment problem combinatorial optimization competitive analysis complexity constrained maximization cooperation scheduling

Editors and affiliations

  • Evripidis Bampis
    • 1
  • Martin Skutella
    • 2
  1. 1.IBISC, CNRS FRE 3190, Université d’Evry Val d’Essonne, Boulevard François Mitterand,Evry CedexFrance
  2. 2.Technische Universität Berlin, Fakultät II - Mathematik und NaturwissenschaftenBerlinGermany

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-540-93980-1
  • Copyright Information Springer-Verlag Berlin Heidelberg 2009
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-93979-5
  • Online ISBN 978-3-540-93980-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book