Editors:
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2161)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (44 papers)
-
Front Matter
-
Data Structures I
-
Shortest Paths
About this book
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.
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
Editors and Affiliations
-
Department of Mathematics and Computer Science and Heinz Nixdorf Institute, Paderborn University, Paderborn, Germany
Friedhelm Meyer Heide
Bibliographic Information
Book Title: Algorithms - ESA 2001
Book Subtitle: 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings
Editors: Friedhelm Meyer Heide
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-44676-1
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2001
Softcover ISBN: 978-3-540-42493-2Published: 15 August 2001
eBook ISBN: 978-3-540-44676-7Published: 15 May 2003
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XII, 544
Topics: Programming Techniques, Theory of Computation, Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Computation by Abstract Devices, Computer Graphics