Skip to main content
SpringerLink
Log in

Implementation Challenge for Shortest Paths

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 281 Accesses

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...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Ahuja R, Magnanti T, Orlin J (1993) Network flows: theory, algorithms and applications. Prentice Hall, Englewood Cliffs

    MATH  Google Scholar 

  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, Piscataway

    Google Scholar 

  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, Piscataway

    Google Scholar 

  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, Piscataway

    Google Scholar 

  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, Piscataway

    Google Scholar 

  6. Delling D, Sanders P, Schultes D, Wagner D (2006) Highway hierarchies star. In: 9th DIMACS implementation challenge workshop: shortest paths. DIMACS Center, Piscataway

    Google Scholar 

  7. Dijkstra E (1959) A note on two problems in connexion with graphs. Numer Math 1:269–271

    Article  MathSciNet  MATH  Google Scholar 

  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, Piscataway

    Google Scholar 

  9. Goldberg A, Kaplan H, Werneck R (2006) Better landmarks within reach. In: 9th DIMACS implementation challenge workshop: shortest paths. DIMACS Center, Piscataway

    Google Scholar 

  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, Piscataway

    Google Scholar 

  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, Piscataway

    Google Scholar 

  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, Piscataway

    Google Scholar 

  13. Pascoal M (2006) Implementations and empirical comparison of k shortest loopless path algorithms. In: 9th DIMACS implementation challenge workshop: shortest paths. DIMACS Center, Piscataway

    Google Scholar 

  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, Piscataway

    Google Scholar 

  15. Santos J (2006) K shortest path algorithms. In: 9th DIMACS implementation challenge workshop: shortest paths. DIMACS Center, Piscataway

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Systems Science, University of Rome, Rome, Italy

    Camil Demetrescu

  2. Department of Information and Computer Systems, University of Rome, Rome, Italy

    Camil Demetrescu

  3. Microsoft Research – Silicon Valley, Mountain View, CA, USA

    Andrew V. Goldberg

  4. Department of Computer Science, Columbia University, New York, NJ, USA

    David S. Johnson

  5. AT&T Laboratories, Algorithms and Optimization Research Department, Florham Park, NJ, USA

    David S. Johnson

Authors
  1. Camil Demetrescu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrew V. Goldberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. David S. Johnson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Camil Demetrescu .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation