Skip to main content
SpringerLink
Log in

A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks

  • Conference paper
Experimental Algorithms (SEA 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6630))

Included in the following conference series:

Abstract

Abraham et al. [SODA 2010] have recently presented a theoretical analysis of several practical point-to-point shortest path algorithms based on modeling road networks as graphs with low highway dimension. They also analyze a labeling algorithm. While no practical implementation of this algorithm existed, it has the best time bounds. This paper describes an implementation of the labeling algorithm that is faster than any existing method on continental road networks.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: A Hub-Based Labeling Algorithm for Shortest Paths on Road Networks. Technical Report MSR-TR-2010-165, Microsoft Research (2010)

    Google Scholar 

  2. Abraham, I., Fiat, A., Goldberg, A.V., Werneck, R.F.: Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. In: SODA, pp. 782–793 (2010)

    Google Scholar 

  3. Bast, H., Funke, S., Matijevic, D.: Ultrafast shortest-path queries via transit nodes. In: Demetrescu, C., et al. (eds.) [10], pp. 175–192

    Google Scholar 

  4. Bast, H., Funke, S., Matijevic, D., Sanders, P., Schultes, D.: In Transit to Constant Shortest-Path Queries in Road Networks. In: ALENEX, pp. 46–59. SIAM, Philadelphia (2007)

    Google Scholar 

  5. Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., Wagner, D.: Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra’s Algorithm. ACM Journal of Experimental Algorithmics 15(2.3), 1–31 (2010)

    MathSciNet  MATH  Google Scholar 

  6. Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32 (2003)

    Google Scholar 

  7. Delling, D., Goldberg, A.V., Nowatzyk, A., Werneck, R.F.: PHAST: Hardware-Accelerated Shortest Path Trees. In: IPDPS. IEEE, Los Alamitos (2011) (to appear)

    Google Scholar 

  8. Delling, D., Goldberg, A.V., Razenshteyn, I., Werneck, R.F.: Graph Partitioning with Natural Cuts. In: IPDPS. IEEE, Los Alamitos (2011) (to appear)

    Google Scholar 

  9. Delling, D., Holzer, M., Müller, K., Schulz, F., Wagner, D.: High-Performance Multi-Level Routing. In: Demetrescu, C., et al. (eds.) [10], pp. 73–92

    Google Scholar 

  10. Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.): The Shortest Path Problem: Ninth DIMACS Implementation Challenge. DIMACS, vol. 74. AMS, Providence (2009)

    MATH  Google Scholar 

  11. Dijkstra, E.W.: A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1, 269–271 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  12. Gavoille, C., Peleg, D., Pérennes, S., Raz, R.: Distance labeling in graphs. J. Algorithms 53(1), 85–112 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  13. Geisberger, R.: Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. Master’s thesis, Karlsruhe University (2008)

    Google Scholar 

  14. Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 319–333. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  15. Goldberg, A.V.: A Practical Shortest Path Algorithm with Linear Expected Time. SIAM Journal on Computing 37, 1637–1655 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  16. Hilger, M., Köhler, E., Möhring, R.H., Schilling, H.: Fast Point-to-Point Shortest Path Computations with Arc-Flags. In: Demetrescu, C., et al. (eds.) [10], pp. 41–72

    Google Scholar 

  17. Knopp, S., Sanders, P., Schultes, D., Schulz, F., Wagner, D.: Computing Many-to-Many Shortest Paths Using Highway Hierarchies. In: ALENEX, pp. 36–45 (2007)

    Google Scholar 

  18. Resende, M., Werneck, R.F.: A Fast Swap-based Local Search Procedure for Location Problems. Annals of Operations Research 150, 205–230 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  19. Sanders, P., Schultes, D.: Highway Hierarchies Hasten Exact Shortest Path Queries. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 568–579. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  20. Schultes, D., Sanders, P.: Dynamic Highway-Node Routing. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 66–79. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  21. Thorup, M., Zwick, U.: Approximate Distance Oracles. Journal of the ACM 52(1), 1–24 (2005)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Microsoft Research Silicon Valley, USA

    Ittai Abraham, Daniel Delling, Andrew V. Goldberg & Renato F. Werneck

Authors
  1. Ittai Abraham
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daniel Delling
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andrew V. Goldberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Renato F. Werneck
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, USA

    Panos M. Pardalos

  2. Division of Economics and Business, Colorado School of Mines, Engineering Hall 310, 816 15th Street, 80401, Golden, CO, USA

    Steffen Rebennack

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F. (2011). A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. In: Pardalos, P.M., Rebennack, S. (eds) Experimental Algorithms. SEA 2011. Lecture Notes in Computer Science, vol 6630. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20662-7_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20662-7_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20661-0

  • Online ISBN: 978-3-642-20662-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation