Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Algorithms -- ESA 2004

12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings

  • Conference proceedings
  • © 2004

Overview

Editors:
  1. Susanne Albers

    1. University of Freiburg, Freiburg, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Tomasz Radzik

    1. Department of Computer Science, King’s College, London, UK

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

Included in the following conference series:

Conference proceedings info: ESA 2004.

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

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.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

Keywords

Table of contents (72 papers)

  1. Front Matter

    Download chapter PDF

  3. Design and Analysis Track

    1. Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects

      • Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Yu
      Pages 4-15

    2. Swap and Mismatch Edit Distance

      • Amihood Amir, Estrella Eisenberg, Ely Porat
      Pages 16-27

    3. Path Decomposition Under a New Cost Measure with Applications to Optical Network Design

      • Elliot Anshelevich, Lisa Zhang
      Pages 28-39

    4. Optimal External Memory Planar Point Enclosure

      • Lars Arge, Vasilis Samoladas, Ke Yi
      Pages 40-52

    5. Maximizing Throughput in Multi-queue Switches

      • Yossi Azar, Arik Litichevskey
      Pages 53-64

    6. An Improved Algorithm for CIOQ Switches

      • Yossi Azar, Yossi Richter
      Pages 65-76

    7. Labeling Smart Dust

      • Vikas Bansal, Friedhelm Meyer auf der Heide, Christian Sohler
      Pages 77-88

    8. Graph Decomposition Lemmas and Their Role in Metric Embedding Methods

      • Yair Bartal
      Pages 89-97

    9. Modeling Locality: A Probabilistic Analysis of LRU and FWF

      • Luca Becchetti
      Pages 98-109

    10. An Algorithm for Computing DNA Walks

      • Ankur Bhargava, S. Rao Kosaraju
      Pages 110-121

    11. Algorithms for Generating Minimal Blockers of Perfect Matchings in Bipartite Graphs and Related Problems

      • Endre Boros, Khaled Elbassioni, Vladimir Gurvich
      Pages 122-133

    12. Direct Routing: Algorithms and Complexity

      • Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul Spirakis
      Pages 134-145

    13. Lower Bounds for Embedding into Distributions over Excluded Minor Graph Families

      • Douglas E. Carroll, Ashish Goel
      Pages 146-156

    14. A Parameterized Algorithm for Upward Planarity Testing

      • Hubert Chan
      Pages 157-168

    15. Fisher Equilibrium Price with a Class of Concave Utility Functions

      • Ning Chen, Xiaotie Deng, Xiaoming Sun, Andrew Chi-Chih Yao
      Pages 169-179

    16. Hardness and Approximation Results for Packing Steiner Trees

      • Joseph Cheriyan, Mohammad R. Salavatipour
      Pages 180-191

    17. Approximation Hardness of Dominating Set Problems

      • Miroslav ChlebĂ­k, Janka ChlebĂ­ková
      Pages 192-203
Back to top

Other volumes

  1. Algorithms – ESA 2004

Editors and Affiliations

  • University of Freiburg, Freiburg, Germany

    Susanne Albers

  • Department of Computer Science, King’s College, London, UK

    Tomasz Radzik

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation