Approximation and Online Algorithms

Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Papers

  • Thomas Erlebach
  • Giuseppe Persinao
Conference proceedings WAOA 2005

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

Table of contents

  1. Front Matter
  2. David J. Abraham, Péter Biró, David F. Manlove
    Pages 1-14
  3. Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Aleš Přívětivý, Anand Srivastav
    Pages 15-26
  4. Adi Avidor, Ido Berkovitch, Uri Zwick
    Pages 27-40
  5. Reuven Bar-Yehuda, Ido Feldman, Dror Rawitz
    Pages 55-68
  6. Reuven Bar-Yehuda, Jonathan Laserson
    Pages 69-81
  7. Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild
    Pages 96-109
  8. Tomáš Ebenlendr, John Noga, Jiří Sgall, Gerhard Woeginger
    Pages 110-118
  9. Leah Epstein, Asaf Levin
    Pages 119-132
  10. Leah Epstein, Asaf Levin
    Pages 133-146
  11. A. Ferrante, G. Parlato, F. Sorrentino, C. Ventre
    Pages 147-160
  12. Dimitris Fotakis, Spyros Kontogiannis, Paul Spirakis
    Pages 161-175
  13. Toshihiro Fujito, Hidekazu Kurahashi
    Pages 176-189
  14. Elisabeth Gassner, Sven O. Krumke
    Pages 190-202
  15. Alexander Grigoriev, Marc Uetz
    Pages 203-215
  16. Xin Han, Kazuo Iwama, Guochuan Zhang
    Pages 216-229
  17. S. Heinz, S. O. Krumke, N. Megow, J. Rambau, A. Tuchscherer, T. Vredeveld
    Pages 230-243
  18. Ronald Koch, Martin Skutella, Ines Spenke
    Pages 244-257

About these proceedings

Introduction

The third Workshop on Approximation and Online Algorithms (WAOA 2005) 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 2005 took place in Palma de Mallorca, Spain, on 6–7 October 2005. The workshop was part of the ALGO 2005 event that also hosted ESA, WABI, and ATMOS. The two previous WAOA workshops were held in Budapest (2003) and Rome (2004). Topics of interest for WAOA 2005 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, rand- izationtechniques,real-worldapplications,andschedulingproblems.Inresponse to the call for papers we received 68 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 26 papers. We are grateful to Andrei Voronkov for providing the EasyChair conference system,whichwasusedtomanagetheelectronicsubmissions,thereviewprocess, and the electronic PC meeting. It made our task much easier. We would also like to thank all the authors who submitted papers to WAOA 2005 as well as the local organizers of ALGO 2005.

Keywords

algorithm analysis algorithm design algorithmics approximation algorithms combinatorial graph theory complexity design discrete mathematics geometric algorithms graph algorithms graph drawing network algorithms online algorithms randomized a structured analysis

Editors and affiliations

  • Thomas Erlebach
    • 1
  • Giuseppe Persinao
    • 2
  1. 1.Department of Computer ScienceUniversity of LeicesterLeicesterUK
  2. 2.Via Dipartimento di IInformatica ed ApplicazioniUniversit{‘a degli Studi di SalernoBaronissiItaly

Bibliographic information

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