Skip to main content
SpringerLink
Log in

Hierarchical Hub Labelings for Shortest Paths

  • Conference paper
Algorithms – ESA 2012 (ESA 2012)

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

Included in the following conference series:

Abstract

We study hierarchical hub labelings for computing shortest paths. Our new theoretical insights into the structure of hierarchical labels lead to faster preprocessing algorithms, making the labeling approach practical for a wider class of graphs. We also find smaller labels for road networks, improving the query speed.

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., Fiat, A., Goldberg, A.V., Werneck, R.F.: VC-Dimension and Shortest Path Algorithms. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 690–699. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  2. Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 230–241. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  3. Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Hierarchical Hub Labelings for Shortest Paths. MSR-TR-2012-46. Microsoft Research (2012)

    Google Scholar 

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

  5. Bader, D.A., Meyerhenke, H., Sanders, P., Wagner, D.: 10th DIMACS Implementation Challenge – Graph Partitioning and Graph Clustering (2011)

    Google Scholar 

  6. 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 (2007)

    Google Scholar 

  7. 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 J. of Exp. Algo. 15(2.3), 1–31 (2010)

    MathSciNet  Google Scholar 

  8. Cheng, J., Yu, J.X.: On-line Exact Shortest Distance Query Processing. In: EDBT, pp. 481–492. ACM Press (2009)

    Google Scholar 

  9. Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and Distance Queries via 2-hop Labels. SIAM J. Comput. 32 (2003)

    Google Scholar 

  10. Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Customizable Route Planning. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 376–387. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  11. Delling, D., Goldberg, A.V., Werneck, R.F.: Faster Batched Shortest Paths in Road Networks. In: ATMOS, OASIcs, vol. 20, pp. 52–63 (2011)

    Google Scholar 

  12. Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering Route Planning Algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS, vol. 5515, pp. 117–139. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  15. Fredman, M.L., Tarjan, R.E.: Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms. J. Assoc. Comput. Mach. 34, 596–615 (1987)

    Article  MathSciNet  Google Scholar 

  16. Gavoille, C., Peleg, D., Pérennes, S., Raz, R.: Distance Labeling in Graphs. Journal of Algorithms 53, 85–112 (2004)

    Article  MATH  Google Scholar 

  17. Geisberger, R., Sanders, P., Schultes, D., Vetter, C.: Exact Routing in Large Road Networks Using Contraction Hierarchies. Transportation Science (2012)

    Google Scholar 

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

  19. Kieritz, T., Luxen, D., Sanders, P., Vetter, C.: Distributed Time-Dependent Contraction Hierarchies. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 83–93. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  20. Kleinberg, J.: Navigation in a Small World. Nature 406, 845 (2000)

    Article  Google Scholar 

  21. Sander, P.V., Nehab, D., Chlamtac, E., Hoppe, H.: Efficient Traversal of Mesh Edges Using Adjacency Primitives. ACM Trans. on Graphics 27, 144:1–144:9 (2008)

    Article  Google Scholar 

  22. Watts, D., Strogatz, S.: Collective Dynamics of “Small-World” Networks. Nature 393, 409–410 (1998)

    Article  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. Department of Mathematics, University of Haifa, Mount Carmel, 31905, Haifa, Israel

    Leah Epstein

  2. Dipartimento di Informatica, Università di Pisa, Largo B. Pontecorvo 3, 56100, Pisa, Italy

    Paolo Ferragina

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F. (2012). Hierarchical Hub Labelings for Shortest Paths. In: Epstein, L., Ferragina, P. (eds) Algorithms – ESA 2012. ESA 2012. Lecture Notes in Computer Science, vol 7501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33090-2_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33090-2_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33089-6

  • Online ISBN: 978-3-642-33090-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation