Skip to main content
  • Conference proceedings
  • © 2004

Algorithms -- ESA 2004

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

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

Conference series link(s): ESA: European Symposium on Algorithms

Conference proceedings info: ESA 2004.

Buying options

eBook USD 84.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (72 papers)

  1. Front Matter

  2. 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. Optimal External Memory Planar Point Enclosure

      • Lars Arge, Vasilis Samoladas, Ke Yi
      Pages 40-52
    4. Maximizing Throughput in Multi-queue Switches

      • Yossi Azar, Arik Litichevskey
      Pages 53-64
    5. An Improved Algorithm for CIOQ Switches

      • Yossi Azar, Yossi Richter
      Pages 65-76
    6. Labeling Smart Dust

      • Vikas Bansal, Friedhelm Meyer auf der Heide, Christian Sohler
      Pages 77-88
    7. An Algorithm for Computing DNA Walks

      • Ankur Bhargava, S. Rao Kosaraju
      Pages 110-121
    8. Direct Routing: Algorithms and Complexity

      • Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul Spirakis
      Pages 134-145
    9. Fisher Equilibrium Price with a Class of Concave Utility Functions

      • Ning Chen, Xiaotie Deng, Xiaoming Sun, Andrew Chi-Chih Yao
      Pages 169-179
    10. Hardness and Approximation Results for Packing Steiner Trees

      • Joseph Cheriyan, Mohammad R. Salavatipour
      Pages 180-191
    11. Approximation Hardness of Dominating Set Problems

      • Miroslav Chlebík, Janka Chlebíková
      Pages 192-203

Other Volumes

  1. Algorithms – ESA 2004

Keywords

  • Variable
  • algorithm analysis
  • algorithm design
  • algorithm theory
  • algorithmic mathematics
  • algorithmics
  • algorithms
  • approximation
  • calculus
  • complexity
  • computational complexity
  • data structures
  • external memory
  • graph algorithms
  • modeling
  • algorithm analysis and problem complexity

Editors and Affiliations

  • University of Freiburg, Freiburg, Germany

    Susanne Albers

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

    Tomasz Radzik

Bibliographic Information

Buying options

eBook USD 84.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions