Algorithms ESA 2001 : 9th annual European symposium, Åarhus, Denmark, August 28 31, 2001 : proceedings | ESA '2001 (2001 : Aarhus, Denmark), Meyer auf der Heide, F. (Friedhelm), 1954-

Algorithms — ESA 2001: 9th Annual European Symposium Århus, Denmark, August 28–31, 2001 Proceedings
Author: Friedhelm Meyer auf der Heide
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-42493-2
DOI: 10.1007/3-540-44676-1

Table of Contents:

External Memory Data Structures
Some Algorithmic Problems in Large Networks
Exact and Approximate Distances in Graphs — A Survey
Strongly Competitive Algorithms for Caching with Pipelined Prefetching
Duality between Prefetching and Queued Writing with Parallel Disks
Online Bin Coloring
A General Decomposition Theorem for the k-Server Problem
Buying a Constant Competitive Ratio for Paging
Simple Minimal Perfect Hashing in Less Space
Cuckoo Hashing
Coupling Variable Fixing Algorithms for the Automatic Recording Problem
Approximation Algorithms for Scheduling Malleable Tasks under Precedence Constraints
On the Approximability of the Minimum Test Collection Problem
Finding Approximate Repetitions under Hamming Distance
SNPs Problems, Complexity, and Algorithms
A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs
Grouping Techniques for Scheduling Problems: Simpler and Faster
A 2-Approximation Algorithm for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times
A Simple Shortest Path Algorithm with Linear Average Time
A Heuristic for Dijkstra’s Algorithm with Many Targets and Its Use in Weighted Matching Algorithms

Includes bibliographical references and index

Download Zip 1 Pdf 5.84 MB More File Format

Download PDF . 5.84 MB