Skip to main content
SpringerLink
Log in
Book cover

Approximation and Online Algorithms

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

  • Conference proceedings
  • © 2006

Overview

Editors:
  1. Thomas Erlebach

    1. Department of Computer Science, University of Leicester, Leicester, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Giuseppe Persinao

    1. Via Dipartimento di IInformatica ed Applicazioni, Universit{‘a degli Studi di Salerno, Baronissi, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: WAOA 2005.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (26 papers)

  1. Front Matter

    Download chapter PDF

  2. “Almost Stable” Matchings in the Roommates Problem

    • David J. Abraham, Péter Biró, David F. Manlove
    Pages 1-14

  3. On the Minimum Load Coloring Problem

    • Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Aleš Přívětivý, Anand Srivastav
    Pages 15-26

  4. Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT

    • Adi Avidor, Ido Berkovitch, Uri Zwick
    Pages 27-40

  5. The Hardness of Network Design for Unsplittable Flow with Selfish Users

    • Yossi Azar, Amir Epstein
    Pages 41-54

  6. Improved Approximation Algorithm for Convex Recoloring of Trees

    • Reuven Bar-Yehuda, Ido Feldman, Dror Rawitz
    Pages 55-68

  7. Exploiting Locality: Approximating Sorting Buffers

    • Reuven Bar-Yehuda, Jonathan Laserson
    Pages 69-81

  8. Approximate Fair Cost Allocation in Metric Traveling Salesman Games

    • M. Bläser, L. Shankar Ram
    Pages 82-95

  9. Rounding of Sequences and Matrices, with Applications

    • Benjamin Doerr, Tobias Friedrich, Christian Klein, Ralf Osbild
    Pages 96-109

  10. A Note on Semi-online Machine Covering

    • Tomáš Ebenlendr, John Noga, Jiří Sgall, Gerhard Woeginger
    Pages 110-118

  11. SONET ADMs Minimization with Divisible Paths

    • Leah Epstein, Asaf Levin
    Pages 119-132

  12. The Conference Call Search Problem in Wireless Networks

    • Leah Epstein, Asaf Levin
    Pages 133-146

  13. Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish Agents

    • A. Ferrante, G. Parlato, F. Sorrentino, C. Ventre
    Pages 147-160

  14. Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost

    • Dimitris Fotakis, Spyros Kontogiannis, Paul Spirakis
    Pages 161-175

  15. A Better-Than-Greedy Algorithm for k-Set Multicover

    • Toshihiro Fujito, Hidekazu Kurahashi
    Pages 176-189

  16. Deterministic Online Optical Call Admission Revisited

    • Elisabeth Gassner, Sven O. Krumke
    Pages 190-202

  17. Scheduling Parallel Jobs with Linear Speedup

    • Alexander Grigoriev, Marc Uetz
    Pages 203-215

  18. Online Removable Square Packing

    • Xin Han, Kazuo Iwama, Guochuan Zhang
    Pages 216-229

  19. The Online Target Date Assignment Problem

    • S. Heinz, S. O. Krumke, N. Megow, J. Rambau, A. Tuchscherer, T. Vredeveld
    Pages 230-243

  20. Approximation and Complexity of k–Splittable Flows

    • Ronald Koch, Martin Skutella, Ines Spenke
    Pages 244-257
Back to top

Other volumes

  1. Approximation and Online Algorithms

Keywords

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.

Editors and Affiliations

  • Department of Computer Science, University of Leicester, Leicester, UK

    Thomas Erlebach

  • Via Dipartimento di IInformatica ed Applicazioni, Universit{‘a degli Studi di Salerno, Baronissi, Italy

    Giuseppe Persinao

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation