Advertisement

Approximation and Online Algorithms

5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers

  • Editors
  • Christos Kaklamanis
  • Martin Skutella
Conference proceedings WAOA 2007

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

Table of contents

  1. Front Matter
  2. Robert Krauthgamer, Aranyak Mehta, Atri Rudra
    Pages 1-14
  3. Nedialko B. Dimitrov, C. Greg Plaxton
    Pages 27-40
  4. Tobias Brueggemann, Johann L. Hurink, Tjark Vredeveld, Gerhard J. Woeginger
    Pages 41-54
  5. Johann L. Hurink, Jacob Jan Paulus
    Pages 67-74
  6. Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel Smid, Norbert Zeh
    Pages 75-88
  7. Maarten Löffler, Marc van Kreveld
    Pages 89-102
  8. Alexander A. Ageev, Artem V. Pyatkin
    Pages 103-115
  9. Dorit S. Hochbaum, Asaf Levin
    Pages 116-127
  10. Amitai Armon
    Pages 128-141
  11. Leah Epstein, Asaf Levin
    Pages 142-155
  12. Panagiota N. Panagopoulou, Paul G. Spirakis
    Pages 156-169
  13. Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette
    Pages 170-183
  14. José R. Correa, Cristina G. Fernandes, Martín Matamala, Yoshiko Wakabayashi
    Pages 184-192
  15. Leah Epstein, Rob van Stee
    Pages 193-206
  16. Marek Chrobak, Mathilde Hurand
    Pages 207-217
  17. Leah Epstein, Asaf Levin
    Pages 218-231
  18. Wolfgang Bein, Kazuo Iwama, Jun Kawahara, Lawrence L. Larmore, James A. Oravec
    Pages 246-259
  19. Haitao Wang, Amitabh Chaudhary, Danny Z. Chen
    Pages 274-287
  20. Back Matter

About these proceedings

Introduction

The Fifth Workshop on Approximation and Online Algorithms (WAOA 2007) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications from a variety of ?elds. WAOA 2007 took place in Eilat, Israel, during October 11–12, 2007. The workshop was part of the ALGO 2007 event that also hosted ESA 2007, and PEGG 2007. The previous WAOA workshops were held in Budapest (2003), Rome (2004), Palma de Mallorca (2005) and Zurich (2006). The proceedings of these previous WAOA workshops have appeared as LNCS volumes 2909, 3351, 3879 and 4368, respectively. Topics of interest for WAOA 2007 were: algorithmic game theory, appro- mation classes, coloring and partitioning, competitive analysis, computational ?nance, 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. In response to the call for - pers, we received 56 submissions. Each submission was reviewed by at least three referees, and the vast majority by at least four referees. The submissions were mainly judged on originality, technical quality, and relevance to the topics of the conference. Based on the reviews, the Program Committee selected 22 papers. We are grateful to Andrei Voronkov for providing the EasyChair conference system which was used to manage the electronic submissions, the review process, and the electronic PC meeting. It made our task much easier.

Keywords

Performance algorithm algorithm analysis algorithm design algorithmics algorithms approximation algorithms combinatorial optimization competitive analysis complexity computational graph theory decision making design game theory optimization

Bibliographic information

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