Encyclopedia of Algorithms

2016 Edition
| Editors: Ming-Yang Kao

Implementation Challenge for Shortest Paths

  • Camil Demetrescu
  • Andrew V. Goldberg
  • David S. Johnson
Reference work entry
DOI: https://doi.org/10.1007/978-1-4939-2864-4_181

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

DIMACS Test sets and experimental evaluation of computer programs for solving shortest path problems 
This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Ahuja R, Magnanti T, Orlin J (1993) Network flows: theory, algorithms and applications. Prentice Hall, Englewood CliffszbMATHGoogle Scholar
  2. 2.
    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, PiscatawayGoogle Scholar
  3. 3.
    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, PiscatawayGoogle Scholar
  4. 4.
    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, PiscatawayGoogle Scholar
  5. 5.
    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, PiscatawayGoogle Scholar
  6. 6.
    Delling D, Sanders P, Schultes D, Wagner D (2006) Highway hierarchies star. In: 9th DIMACS implementation challenge workshop: shortest paths. DIMACS Center, PiscatawayGoogle Scholar
  7. 7.
    Dijkstra E (1959) A note on two problems in connexion with graphs. Numer Math 1:269–271MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    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, PiscatawayGoogle Scholar
  9. 9.
    Goldberg A, Kaplan H, Werneck R (2006) Better landmarks within reach. In: 9th DIMACS implementation challenge workshop: shortest paths. DIMACS Center, PiscatawayGoogle Scholar
  10. 10.
    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, PiscatawayGoogle Scholar
  11. 11.
    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, PiscatawayGoogle Scholar
  12. 12.
    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, PiscatawayGoogle Scholar
  13. 13.
    Pascoal M (2006) Implementations and empirical comparison of k shortest loopless path algorithms. In: 9th DIMACS implementation challenge workshop: shortest paths. DIMACS Center, PiscatawayGoogle Scholar
  14. 14.
    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, PiscatawayGoogle Scholar
  15. 15.
    Santos J (2006) K shortest path algorithms. In: 9th DIMACS implementation challenge workshop: shortest paths. DIMACS Center, PiscatawayGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  • Camil Demetrescu
    • 1
    • 2
  • Andrew V. Goldberg
    • 3
  • David S. Johnson
    • 4
    • 5
  1. 1.Department of Computer and Systems ScienceUniversity of RomeRomeItaly
  2. 2.Department of Information and Computer SystemsUniversity of RomeRomeItaly
  3. 3.Microsoft Research – Silicon ValleyMountain ViewUSA
  4. 4.Department of Computer ScienceColumbia UniversityNew YorkUSA
  5. 5.AT&T Laboratories, Algorithms and Optimization Research DepartmentFlorham ParkUSA