Landmark Hub Labeling: Improved Bounds and Faster Query Answering

Authors Justine Cauvi , Ruoying Li , Sabine Storandt



PDF
Thumbnail PDF

File

OASIcs.ATMOS.2024.1.pdf
  • Filesize: 1.11 MB
  • 17 pages

Document Identifiers

Author Details

Justine Cauvi
  • École Normale Supérieure de Lyon, France
  • Department of Computer and Information Science, University of Konstanz, Germany
Ruoying Li
  • Department of Computer and Information Science, University of Konstanz, Germany
Sabine Storandt
  • Department of Computer and Information Science, University of Konstanz, Germany

Cite AsGet BibTex

Justine Cauvi, Ruoying Li, and Sabine Storandt. Landmark Hub Labeling: Improved Bounds and Faster Query Answering. In 24th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2024). Open Access Series in Informatics (OASIcs), Volume 123, pp. 1:1-1:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/OASIcs.ATMOS.2024.1

Abstract

Hub Labeling (HL) is a state-of-the-art method for answering shortest-distance queries between node pairs in weighted graphs. It provides very fast query times but also requires considerable additional space to store the label information. Recently, a generalization of HL, called Landmark Hub Labeling (LHL), has been proposed, that conceptionally allows a storage of fewer label information without compromising the optimality of the query result. However, query answering with LHL was shown to be slower than with HL, both in theory and practice. Furthermore, it was not clear whether there are graphs with a substantial space reduction when using LHL instead of HL. In this paper, we describe a new way of storing label information of an LHL such that query times are significantly reduced and then asymptotically match those of HL. Thus, we alleviate the so far greatest shortcoming of LHL compared to HL. Moreover, we show that for the practically relevant hierarchical versions (HHL and HLHL), there are graphs in which the label size of an optimal HLHL is a factor of Θ(√ n) smaller than that of an optimal HHL. We establish further novel bounds between different labeling variants. Additionally, we provide a comparative experimental study between approximation algorithms for HL and LHL. We demonstrate that label sizes in an LHL are consistently smaller than those of HL across diverse benchmark graphs, including road networks.

Subject Classification

ACM Subject Classification
  • Theory of computation → Graph algorithms analysis
Keywords
  • Route Planning
  • Shortest Path
  • Hub Labeling

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Haris Angelidakis, Yury Makarychev, and Vsevolod Oparin. Algorithmic and hardness results for the hub labeling problem. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1442-1461. SIAM, 2017. Google Scholar
  2. Maxim Babenko, Andrew V Goldberg, Haim Kaplan, Ruslan Savchenko, and Mathias Weller. On the complexity of hub labeling. In International Symposium on Mathematical Foundations of Computer Science, pages 62-74. Springer, 2015. Google Scholar
  3. Jaime Barceló, Hanna Grzybowska, and Sara Pardo. Vehicle routing and scheduling models, simulation and city logistics. Dynamic Fleet Management: Concepts, Systems, Algorithms & Case Studies, pages 163-195, 2007. Google Scholar
  4. Hannah Bast, Daniel Delling, Andrew Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, and Renato F Werneck. Route planning in transportation networks. Algorithm engineering: Selected results and surveys, pages 19-80, 2016. Google Scholar
  5. Michael A Bender, Martin Farach-Colton, Giridhar Pemmasani, Steven Skiena, and Pavel Sumazin. Lowest common ancestors in trees and directed acyclic graphs. Journal of Algorithms, 57(2):75-94, 2005. Google Scholar
  6. Edith Cohen, Eran Halperin, Haim Kaplan, and Uri Zwick. Reachability and distance queries via 2-hop labels. SIAM Journal on Computing, 32(5):1338-1355, 2003. Google Scholar
  7. Daniel Delling, Andrew V Goldberg, Thomas Pajor, and Renato F Werneck. Robust exact distance queries on massive networks. Microsoft Research, USA, Tech. Rep, 2, 2014. Google Scholar
  8. Daniel Delling, Andrew V Goldberg, Ruslan Savchenko, and Renato F Werneck. Hub labels: Theory and practice. In Experimental Algorithms: 13th International Symposium, SEA 2014, Copenhagen, Denmark, June 29-July 1, 2014. Proceedings 13, pages 259-270. Springer, 2014. Google Scholar
  9. Daniel Delling, Andrew V Goldberg, and Renato F Werneck. Hub label compression. In International symposium on experimental algorithms, pages 18-29. Springer, 2013. Google Scholar
  10. PC Gilmore. Families of sets with faithful graph representation. IBM Research Note NC, 184, 1962. Google Scholar
  11. András Gyárfás and Jenö Lehel. A helly-type problem in trees. Combinatorial Theory and its applications, 4:571-584, 1970. Google Scholar
  12. Kartik Lakhotia, Qing Dong, Rajgopal Kannan, and Viktor Prasanna. Planting trees for scalable and efficient canonical hub labeling. arXiv preprint arXiv:1907.00140, 2019. Google Scholar
  13. Sara Nazari, M Reza Meybodi, M Ali Salehigh, and Sara Taghipour. An advanced algorithm for finding shortest path in car navigation system. In 2008 First International Conference on Intelligent Networks and Intelligent Systems, pages 671-674. IEEE, 2008. Google Scholar
  14. Kali Prasad Nepal and Dongjoo Park. Solving the median shortest path problem in the planning and design of urban transportation networks using a vector labeling algorithm. Transportation Planning and Technology, 28(2):113-133, 2005. Google Scholar
  15. Sven Peyer, Dieter Rautenbach, and Jens Vygen. A generalization of dijkstra’s shortest path algorithm with applications to vlsi routing. Journal of Discrete Algorithms, 7(4):377-390, 2009. Google Scholar
  16. Sabine Storandt. Algorithms for landmark hub labeling. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. Google Scholar
  17. Sabine Storandt. Scalable landmark hub labeling for optimal and bounded suboptimal pathfinding. In Kate Larson, editor, Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, IJCAI-24, pages 6788-6795. International Joint Conferences on Artificial Intelligence Organization, August 2024. Main Track. URL: https://doi.org/10.24963/ijcai.2024/750.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail