Skip to main content
SpringerLink
Log in

Approximation and Online Algorithms

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

  • Conference proceedings
  • © 2005

Overview

Editors:
  1. Giuseppe Persiano

    1. Dipartimento di Informatica ed Applicazioni, Università di Salerno, Fisciano, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Roberto Solis-Oba

    1. Department of Computer Science, The University of Western Ontario, London, Canada

    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 3351)

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

Included in the following conference series:

Conference proceedings info: WAOA 2004.

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 (23 papers)

  1. Front Matter

    Download chapter PDF

  3. Regular Papers

    1. Minimum Sum Multicoloring on the Edges of Planar Graphs and Partial k-Trees

      • Dániel Marx
      Pages 9-22

    2. Online Bin Packing with Resource Augmentation

      • Leah Epstein, Rob van Stee
      Pages 23-35

    3. A PTAS for Delay Minimization in Establishing Wireless Conference Calls

      • Leah Epstein, Asaf Levin
      Pages 36-47

    4. This Side Up!

      • Leah Epstein, Rob van Stee
      Pages 48-60

    5. Approximation Algorithm for Directed Multicuts

      • Yana Kortsarts, Guy Kortsarz, Zeev Nutov
      Pages 61-67

    6. Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria

      • Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
      Pages 68-82

    7. Approximation Algorithms for Spreading Points

      • Sergio Cabello
      Pages 83-96

    8. More Powerful and Simpler Cost-Sharing Methods

      • Paolo Penna, Carmine Ventre
      Pages 97-110

    9. Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints

      • Hadas Shachnai, Oded Shmueli, Robert Sayegh
      Pages 111-125

    10. Priority Algorithms for Graph Optimization Problems

      • Allan Borodin, Joan Boyar, Kim S. Larsen
      Pages 126-139

    11. Pricing Network Edges to Cross a River

      • Alexander Grigoriev, Stan van Hoesel, Anton F. van der Kraaij, Marc Uetz, Mustapha Bouhtou
      Pages 140-153

    12. Submodular Integer Cover and Its Application to Production Planning

      • Toshihiro Fujito, Takatoshi Yabuta
      Pages 154-166

    13. Stochastic Online Scheduling on Parallel Machines

      • Nicole Megow, Marc Uetz, Tjark Vredeveld
      Pages 167-180

    14. A \(\frac{5}{4}\)-Approximation Algorithm for Biconnecting a Graph with a Given Hamiltonian Path

      • Davide Bilò, Guido Proietti
      Pages 181-196

    15. Order-Preserving Transformations and Greedy-Like Algorithms

      • Spyros Angelopoulos
      Pages 197-210

    16. Off-line Admission Control for Advance Reservations in Star Networks

      • Udo Adamy, Thomas Erlebach, Dieter Mitsche, Ingo Schurr, Bettina Speckmann, Emo Welzl
      Pages 211-224

    17. Joint Base Station Scheduling

      • Thomas Erlebach, Riko Jacob, Matúš Mihaľák, Marc Nunkesser, Gábor Szabó, Peter Widmayer
      Pages 225-238
Back to top

Other volumes

  1. Approximation and Online Algorithms

Keywords

About this book

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.

Editors and Affiliations

  • Dipartimento di Informatica ed Applicazioni, Università di Salerno, Fisciano, Italy

    Giuseppe Persiano

  • Department of Computer Science, The University of Western Ontario, London, Canada

    Roberto Solis-Oba

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation