Advertisement

Approximation and Online Algorithms

Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers

  • Giuseppe Persiano
  • Roberto Solis-Oba
Conference proceedings WAOA 2004

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

Table of contents

  1. Front Matter
  2. Invited Talks

  3. Regular Papers

    1. Leah Epstein, Rob van Stee
      Pages 23-35
    2. Leah Epstein, Rob van Stee
      Pages 48-60
    3. Yana Kortsarts, Guy Kortsarz, Zeev Nutov
      Pages 61-67
    4. Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
      Pages 68-82
    5. Paolo Penna, Carmine Ventre
      Pages 97-110
    6. Allan Borodin, Joan Boyar, Kim S. Larsen
      Pages 126-139
    7. Alexander Grigoriev, Stan van Hoesel, Anton F. van der Kraaij, Marc Uetz, Mustapha Bouhtou
      Pages 140-153
    8. Toshihiro Fujito, Takatoshi Yabuta
      Pages 154-166
    9. Nicole Megow, Marc Uetz, Tjark Vredeveld
      Pages 167-180
    10. Udo Adamy, Thomas Erlebach, Dieter Mitsche, Ingo Schurr, Bettina Speckmann, Emo Welzl
      Pages 211-224
    11. Thomas Erlebach, Riko Jacob, Matúš Mihaľák, Marc Nunkesser, Gábor Szabó, Peter Widmayer
      Pages 225-238
    12. Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas
      Pages 239-252
    13. Geir Agnarsson, Magnús M. Halldórsson
      Pages 253-266
    14. Pasquale Ambrosio, Vincenzo Auletta
      Pages 267-280
    15. Leah Epstein, Asaf Levin
      Pages 281-294
  4. Back Matter

About these proceedings

Introduction

The 2nd Workshop on Approximation and Online Algorithms (WAOA 2004) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications arising from a variety of ?elds. WAOA 2004 took place in Bergen, Norway, from September 14 to September 16, 2004. The workshop was part of the ALGO 2004 event which also hosted ESA, WABI, IWPEC, and ATMOS. TopicsofinterestsforWAOA2004were:applicationstogametheory,appr- imation classes, coloring and partitioning, competitive analysis, computational ?nance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, routing, packing and covering, paradigms, randomization techniques, and scheduling problems. In response to our call we received 47 submissions. Each submission was reviewed by at least 3 referees, who judged the paper on originality, quality, and consistency with the topics of the conference. Based on the reviews, the Program Committee selected 21 papers. This volume contains the 21 selected papers and the two invited talks given by Yossi Azar and Klaus Jansen. We thank all the authors who submitted papers to the workshop and we also kindly thank the local organizers of ALGO 2004.

Keywords

algorithm analysis algorithm design algorithms approximation algorithms combinatorial optimization computational graph theory discrete mathematics game theory geometric algorithms graph algorithms network algorithms online algorithms optimization randomized algorithms

Editors and affiliations

  • Giuseppe Persiano
    • 1
  • Roberto Solis-Oba
    • 2
  1. 1.Dipartimento di Informatica ed ApplicazioniUniversità di SalernoFiscianoItaly
  2. 2.Department of Computer ScienceThe University of Western OntarioLondonCanada

Bibliographic information

  • DOI https://doi.org/10.1007/b106130
  • Copyright Information Springer-Verlag Berlin Heidelberg 2005
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-24574-2
  • Online ISBN 978-3-540-31833-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Biotechnology
Finance, Business & Banking
Electronics
IT & Software
Telecommunications
Energy, Utilities & Environment
Engineering