Approximation and Online Algorithms

First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003. Revised Papers

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

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

Table of contents

  1. Front Matter
  2. Contributed Talks

    1. Udo Adamy, Thomas Erlebach
      Pages 1-12
    2. Alexander A. Ageev, Aleksei V. Fishkin, Alexander V. Kononov, Sergey V. Sevastianov
      Pages 13-26
    3. Spyros Angelopoulos
      Pages 27-40
    4. Baruch Awerbuch, Yossi Azar, Yossi Richter, Dekel Tsur
      Pages 41-52
    5. Yossi Azar, Amir Epstein, Leah Epstein
      Pages 53-66
    6. Ioannis Caragiannis, Christos Kaklamanis, Evi Papaioannou
      Pages 67-80
    7. Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano, Anastasios Sidiropoulos
      Pages 81-94
    8. Thomas Decker, Thomas Lücking, Burkhard Monien
      Pages 95-108
    9. Thomas Erlebach, Vanessa Kääb, Rolf H. Möhring
      Pages 123-136
    10. Giulia Galbiati, Edoardo Amaldi
      Pages 151-164
    11. Tom Kamphans, Elmar Langetepe
      Pages 165-178
    12. Elias Koutsoupias, Akash Nanavati
      Pages 179-191
    13. Sven O. Krumke, Nicole Megow, Tjark Vredeveld
      Pages 192-205
    14. Deshi Ye, Guochuan Zhang
      Pages 235-247

About these proceedings

Introduction

The Workshop on Approximation and Online Algorithms (WAOA 2003) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications ar- ing from a variety of ?elds. The workshop also covered experimental research on approximation and online algorithms. WAOA 2003 took place in Budapest, Hungary, from September 16 to September 18. The workshop was part of the ALGO 2003 event, which also hosted ESA 2003, WABI 2003, and ATMOS 2003. TopicsofinterestforWAOA2003were:competitiveanalysis,inapproximab- ityresults,randomizationtechniques,approximationclasses,scheduling,coloring and partitioning, cuts and connectivity, packing and covering, geometric pr- lems, network design, and applications to game theory and ?nancial problems. In response to our call for papers we received 41 submissions. Each submission was reviewed by at least 3 referees, who judged the papers on originality, quality, and consistency with the topics of the conference. Based on these reviews the program committee selected 19 papers for presentation at the workshop and for publication in this proceedings. This volume contains the 19 selected papers and 5 invited abstracts from an ARACNE minisymposium which took place as part of WAOA.

Keywords

Augmented Reality algorithms approximation algorithms combinatorics computational graph theory design discrete mathematics game theory geometric algorithms graph algorithms load balancing network algorithms online algorithms randomized algorithms scheduling algorithms

Editors and affiliations

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

Bibliographic information

  • DOI https://doi.org/10.1007/b95598
  • Copyright Information Springer-Verlag Berlin Heidelberg 2004
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-21079-5
  • Online ISBN 978-3-540-24592-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book