More than 1,900 Springer Protocols eBooks at just $9.99 each! Get yours today>>

Theoretical Computer Science and General Issues

Approximation and Online Algorithms

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

Editors: Erlebach, Thomas, Persiano, Giuseppe (Eds.)

Buy this book

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

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.

Table of contents (26 chapters)

  • “Almost Stable” Matchings in the Roommates Problem

    Abraham, David J. (et al.)

    Pages 1-14

  • On the Minimum Load Coloring Problem

    Ahuja, Nitin (et al.)

    Pages 15-26

  • Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT

    Avidor, Adi (et al.)

    Pages 27-40

  • The Hardness of Network Design for Unsplittable Flow with Selfish Users

    Azar, Yossi (et al.)

    Pages 41-54

  • Improved Approximation Algorithm for Convex Recoloring of Trees

    Bar-Yehuda, Reuven (et al.)

    Pages 55-68

Buy this book

eBook $79.99
price for USA (gross)
  • ISBN 978-3-540-32208-5
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $109.00
price for USA
  • ISBN 978-3-540-32207-8
  • 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
Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Selected Papers
Editors
  • Thomas Erlebach
  • Giuseppe Persiano
Series Title
Theoretical Computer Science and General Issues
Series Volume
3879
Copyright
2006
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-32208-5
DOI
10.1007/11671411
Softcover ISBN
978-3-540-32207-8
Edition Number
1
Number of Pages
X, 349
Topics