Algorithms ESA 2001 : 9th annual European symposium, Åarhus, Denmark, August 28 31, 2001 : proceedings
User Rating: Be the first one!
Author: ESA '2001 (2001 : Aarhus, Denmark), Meyer auf der Heide, F. (Friedhelm), 1954-
Added by: sketch
Added Date: 2015-12-30
Language: eng
Subjects: Computer algorithms
Publishers: Berlin ; New York : Springer
Collections: journals contributions, journals
ISBN Number: 3540424938
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 279.76 MB
PDF Size: 5.84 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Edition: [Elektronische Ressource]
Downloads: 524
Views: 574
Total Files: 18
Media Type: texts
Total Files: 5
TORRENT
springer 10 1007 3 540 44676 1 archive t...torrent
Last Modified: 2023-05-26 03:10:54
Download
Size: 15.04 KB
Description
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:
Includes bibliographical references and index
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
You May Also Like
We will be happy to hear your thoughts