Lecture Notes in Computer Science

Approximation and Online Algorithms

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

Editors: Jansen, Klaus, Solis-Oba, Roberto (Eds.)

Buy this book

eBook $69.99
price for USA (gross)
  • ISBN 978-3-540-24592-6
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $99.00
price for USA
  • ISBN 978-3-540-21079-5
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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.

Table of contents (24 chapters)

  • Online Coloring of Intervals with Bandwidth

    Adamy, Udo (et al.)

    Pages 1-12

  • Open Block Scheduling in Optical Communication Networks

    Ageev, Alexander A. (et al.)

    Pages 13-26

  • Randomized Priority Algorithms

    Angelopoulos, Spyros

    Pages 27-40

  • Tradeoffs in Worst-Case Equilibria

    Awerbuch, Baruch (et al.)

    Pages 41-52

  • Load Balancing of Temporary Tasks in the ℓ p Norm

    Azar, Yossi (et al.)

    Pages 53-66

Buy this book

eBook $69.99
price for USA (gross)
  • ISBN 978-3-540-24592-6
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $99.00
price for USA
  • ISBN 978-3-540-21079-5
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Approximation and Online Algorithms
Book Subtitle
First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers
Editors
  • Klaus Jansen
  • Roberto Solis-Oba
Series Title
Lecture Notes in Computer Science
Series Volume
2909
Copyright
2004
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-24592-6
DOI
10.1007/b95598
Softcover ISBN
978-3-540-21079-5
Series ISSN
0302-9743
Edition Number
1
Number of Pages
VIII, 268
Topics