Years and Authors of Summarized Original Work
2006; Demetrescu, Goldberg, Johnson
Problem Definition
DIMACS Implementation Challenges (http://dimacs.rutgers.edu/Challenges/) are scientific events devoted to assessing the practical performance of algorithms in experimental settings, fostering effective technology transfer and establishing common benchmarks for fundamental computing problems. They are organized by DIMACS, the Center for Discrete Mathematics and Theoretical Computer Science. One of the main goals of DIMACS Implementation Challenges is to address questions of determining realistic algorithm performance where worst case analysis is overly pessimistic and probabilistic models are too unrealistic: experimentation can provide guides to realistic algorithm performance where analysis fails. Experimentation also brings algorithmic questions closer to the original problems that motivated theoretical work. It also tests many assumptions about implementation methods and data...
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsRecommended Reading
Ahuja R, Magnanti T, Orlin J (1993) Network flows: theory, algorithms and applications. Prentice Hall, Englewood Cliffs
Ajwani D, Dementiev U, Meyer R, Osipov V (2006) Breadth first search on massive graphs. In: 9th DIMACS implementation challenge workshop: shortest paths. DIMACS Center, Piscataway
Barrett C, Bissett K, Holzer M, Konjevod G, Marathe M, Wagner D (2006) Implementations of routing algorithms for transportation networks. In: 9th DIMACS implementation challenge workshop: shortest paths. DIMACS Center, Piscataway
Bast H, Funke S, Matijevic D (2006) Transit: ultrafast shortest-path queries with linear-time preprocessing. In: 9th DIMACS implementation challenge workshop: shortest paths. DIMACS Center, Piscataway
Delling D, Holzer M, Muller K, Schulz F, Wagner D (2006) High performance multi-level graphs. In: 9th DIMACS implementation challenge workshop: shortest paths. DIMACS Center, Piscataway
Delling D, Sanders P, Schultes D, Wagner D (2006) Highway hierarchies star. In: 9th DIMACS implementation challenge workshop: shortest paths. DIMACS Center, Piscataway
Dijkstra E (1959) A note on two problems in connexion with graphs. Numer Math 1:269–271
Edmonds N, Breuer A, Gregor D, Lumsdaine A (2006) Single source shortest paths with the parallel boost graph library. In: 9th DIMACS implementation challenge workshop: shortest paths. DIMACS Center, Piscataway
Goldberg A, Kaplan H, Werneck R (2006) Better landmarks within reach. In: 9th DIMACS implementation challenge workshop: shortest paths. DIMACS Center, Piscataway
Köhler E, Möhring R, Schilling H (2006) Fast point-to-point shortest path computations with arc-flags. In: 9th DIMACS implementation challenge workshop: shortest paths. DIMACS Center, Piscataway
Lauther U (2006) An experimental evaluation of point-to-point shortest path calculation on road networks with precalculated edge-flags. In: 9th DIMACS implementation challenge workshop: shortest paths. DIMACS Center, Piscataway
Madduri K, Bader D, Berry J, Crobak J (2006) Parallel shortest path algorithms for solving large-scale instances. In: 9th DIMACS implementation challenge workshop: shortest paths. DIMACS Center, Piscataway
Pascoal M (2006) Implementations and empirical comparison of k shortest loopless path algorithms. In: 9th DIMACS implementation challenge workshop: shortest paths. DIMACS Center, Piscataway
Sanders P, Schultes D (2006) Robust, almost constant time shortest-path queries in road networks. In: 9th DIMACS implementation challenge workshop: shortest paths. DIMACS Center, Piscataway
Santos J (2006) K shortest path algorithms. In: 9th DIMACS implementation challenge workshop: shortest paths. DIMACS Center, Piscataway
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Demetrescu, C., Goldberg, A.V., Johnson, D.S. (2016). Implementation Challenge for Shortest Paths. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_181
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_181
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering