Skip to main content
Book cover
  • Conference proceedings
  • © 2001

Algorithms - ESA 2001

9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings

Editors:

  1. Friedhelm Meyer Heide

    1. Department of Mathematics and Computer Science and Heinz Nixdorf Institute, Paderborn University, Paderborn, Germany

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

Sections

eBook USD 99.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-44676-7
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 129.00
Price excludes VAT (USA)
Learn about institutional subscriptions

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

Table of contents (44 papers)

  1. Front Matter

    Pages I-XII
    PDF

  3. Caching and Prefetching

    1. Strongly Competitive Algorithms for Caching with Pipelined Prefetching

      • Alexander Gaysinsky, Alon Itai, Hadas Shachnai
      Pages 49-61

    2. Duality between Prefetching and Queued Writing with Parallel Disks

      • David A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter
      Pages 62-73

  4. Online Algorithms

    1. Online Bin Coloring

      • Sven O. Krumke, Willem E. de Paepe, Jörg Rambau, Leen Stougie
      Pages 74-85

    3. Buying a Constant Competitive Ratio for Paging

      • János Csirik, Csanád Imreh, John Noga, Steve S. Seiden, Gerhard J. Woeginger
      Pages 98-108

  5. Data Structures I

    1. Simple Minimal Perfect Hashing in Less Space

      • Martin Dietzfelbinger, Torben Hagerup
      Pages 109-120

    2. Cuckoo Hashing

      • Rasmus Pagh, Flemming Friche Rodler
      Pages 121-133

  6. Optimization and Approximation

    1. Coupling Variable Fixing Algorithms for the Automatic Recording Problem

      • Meinolf Sellmann, Torsten Fahle
      Pages 134-145

    2. Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints

      • Renaud Lepére, Denis Trystram, Gerhard J. Woeginger
      Pages 146-157

    3. On the Approximability of the Minimum Test Collection Problem

      • Bjarni V. Halldórsson, Magnús M. Halldórsson, R. Ravi
      Pages 158-169

  7. Sequences

    1. Finding Approximate Repetitions under Hamming Distance

      • Roman Kolpakov, Gregory Kucherov
      Pages 170-181

    2. SNPs Problems, Complexity, and Algorithms

      • Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross Lippert, Russell Schwartz
      Pages 182-193

  8. Scheduling

    1. A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs

      • Eric Angel, Evripidis Bampis, Alexander Kononov
      Pages 194-205

    2. Grouping Techniques for Scheduling Problems: Simpler and Faster

      • Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli
      Pages 206-217

  9. Shortest Paths

Back to top

About this book

This book constitutes the refereed proceedings of the 9th Annual European Symposium on Algorithms, ESA 2001, held in Aarhus, Denmark, in August 2001.
The 41 revised full papers presented together with three invited contributions were carefully reviewed and selected from 102 submissions. The papers are organized in topical sections on caching and prefetching, online algorithms, data structures, optimization and approximation, sequences, scheduling, shortest paths, geometry, distributed algorithms, graph algorithms, pricing, broadcasting and multicasting, graph labeling and graph drawing, and graphs.
Back to top

Keywords

  • Algorithmics
  • Combinatorial Optimization
  • Computational Complexity
  • Computational Mathematics
  • Computational Science
  • Distributed Algorithms
  • Graph Computations
  • Network Algorithms
  • Online Algorithms
  • Randomized Algorithms
  • algorithms
  • data structures
  • optimization
  • scheduling
  • algorithm analysis and problem complexity
Back to top

Editors and Affiliations

  • Department of Mathematics and Computer Science and Heinz Nixdorf Institute, Paderborn University, Paderborn, Germany

    Friedhelm Meyer Heide

Back to top

Bibliographic Information

Back to top
Access via your institution
eBook USD 99.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-44676-7
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 129.00
Price excludes VAT (USA)
Learn about institutional subscriptions