Algorithms — ESA 2001

9th Annual European Symposium Århus, Denmark, August 28–31, 2001 Proceedings

Editors:

ISBN: 978-3-540-42493-2 (Print) 978-3-540-44676-7 (Online)

Table of contents (44 chapters)

previous Page of 3
  1. Invited Talks

    1. No Access

      Book Chapter

      Pages 1-29

      External Memory Data Structures

    2. No Access

      Book Chapter

      Pages 30-32

      Some Algorithmic Problems in Large Networks

    3. No Access

      Book Chapter

      Pages 33-48

      Exact and Approximate Distances in Graphs — A Survey

  2. Caching and Prefetching

    1. No Access

      Book Chapter

      Pages 49-61

      Strongly Competitive Algorithms for Caching with Pipelined Prefetching

    2. No Access

      Book Chapter

      Pages 62-73

      Duality between Prefetching and Queued Writing with Parallel Disks

  3. Online Algorithms

    1. No Access

      Book Chapter

      Pages 74-85

      Online Bin Coloring

    2. No Access

      Book Chapter

      Pages 86-97

      A General Decomposition Theorem for the k-Server Problem

    3. No Access

      Book Chapter

      Pages 98-108

      Buying a Constant Competitive Ratio for Paging

  4. Data Structures I

    1. No Access

      Book Chapter

      Pages 109-120

      Simple Minimal Perfect Hashing in Less Space

    2. No Access

      Book Chapter

      Pages 121-133

      Cuckoo Hashing

  5. Optimization and Approximation

    1. No Access

      Book Chapter

      Pages 134-145

      Coupling Variable Fixing Algorithms for the Automatic Recording Problem

    2. No Access

      Book Chapter

      Pages 146-157

      Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints

    3. No Access

      Book Chapter

      Pages 158-169

      On the Approximability of the Minimum Test Collection Problem

  6. Sequences

    1. No Access

      Book Chapter

      Pages 170-181

      Finding Approximate Repetitions under Hamming Distance

    2. No Access

      Book Chapter

      Pages 182-193

      SNPs Problems, Complexity, and Algorithms

  7. Scheduling

    1. No Access

      Book Chapter

      Pages 194-205

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

    2. No Access

      Book Chapter

      Pages 206-217

      Grouping Techniques for Scheduling Problems: Simpler and Faster

    3. No Access

      Book Chapter

      Pages 218-229

      A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times

  8. Shortest Paths

    1. No Access

      Book Chapter

      Pages 230-241

      A Simple Shortest Path Algorithm with Linear Average Time

    2. No Access

      Book Chapter

      Pages 242-253

      A Heuristic for Dijkstra’s Algorithm with Many Targets and Its Use in Weighted Matching Algorithms

previous Page of 3