Abstract
We prove a \(\varOmega (\sqrt{n})\) lower bound on the query time for contraction hierarchies (CH) as well as hub labels, two popular speed-up techniques for shortest path routing. Our construction is based on a graph family not too far from subgraphs that occur in real-world road networks, in particular it is planar and has bounded degree. Additionally, we borrow ideas from our lower bound proof to come up with instance-based lower bounds for concrete road network instances of moderate size, reaching up to 83% of an upper bound given by a constructed CH.
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 subscriptionsNotes
- 1.
We define hop length as the number of nodes here.
References
Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Hierarchical hub labelings for shortest paths. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 24–35. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33090-2_4
Abraham, I., Fiat, A., Goldberg, A.V., Werneck, R.F.: Highway dimension, shortest paths, and provably efficient algorithms. In: Proceedings of 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 782–793. SIAM (2010)
Bast, H., Funke, S., Matijevic, D., Sanders, P., Schultes, D.: In transit to constant time shortest-path queries in road networks. In: ALENEX. SIAM (2007)
Bast, H., Funke, S., Sanders, P., Schultes, D.: Fast routing in road networks with transit nodes. Science 316(5824), 566–566 (2007)
Bauer, R., Columbus, T., Rutter, I., Wagner, D.: Search-space size in contraction hierarchies. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7965, pp. 93–104. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-39206-1_9
Bauer, R., Delling, D.: SHARC: fast and robust unidirectional routing. In: ALENEX, pp. 13–26. SIAM (2008)
Blum, J., Funke, S., Storandt, S.: Sublinear search spaces for shortest path planning in grid and road networks. In: Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI), pp. 6119–6126. AAAI Press (2018)
Eisner, J., Funke, S.: Transit nodes - lower bounds and refined construction. In: Proceedings of the 14th Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 141–149. SIAM/Omnipress (2012)
Funke, S., Storandt, S.: Provable efficiency of contraction hierarchies with randomized preprocessing. In: Elbassioni, K., Makino, K. (eds.) ISAAC 2015. LNCS, vol. 9472, pp. 479–490. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-48971-0_41
Geisberger, R., Sanders, P., Schultes, D., Vetter, C.: Exact routing in large road networks using contraction hierarchies. Transp. Sci. 46(3), 388–404 (2012)
Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for \(A^*\): efficient point-to-point shortest path algorithms. In: ALENEX, pp. 129–143. SIAM (2006)
Gutman, R.J.: Reach-based routing: a new approach to shortest path algorithms optimized for road networks. In: ALENEX, pp. 100–111. SIAM (2004)
Kosowski, A., Viennot, L.: Beyond highway dimension: small distance labels using tree skeletons. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1462–1478. SIAM (2017)
Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM J. Appl. Math. 36(2), 177–189 (1979)
Milosavljević, N.: On optimal preprocessing for contraction hierarchies. In: Proceedings of the 5th ACM SIGSPATIAL IWCTS, pp. 33–38. ACM (2012)
Sanders, P., Schultes, D.: Engineering highway hierarchies. ACM J. Exp. Algorithmics 17(1) (2012)
White, C.: Lower bounds in the preprocessing and query phases of routing algorithms. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 1013–1024. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-48350-3_84
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Rupp, T., Funke, S. (2020). A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels. In: Fernau, H. (eds) Computer Science – Theory and Applications. CSR 2020. Lecture Notes in Computer Science(), vol 12159. Springer, Cham. https://doi.org/10.1007/978-3-030-50026-9_26
Download citation
DOI: https://doi.org/10.1007/978-3-030-50026-9_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-50025-2
Online ISBN: 978-3-030-50026-9
eBook Packages: Computer ScienceComputer Science (R0)