Document Open Access Logo

Path-Reporting Distance Oracles with Linear Size

Authors Ofer Neiman, Idan Shabat

PDF
Thumbnail PDF

File

LIPIcs.SWAT.2024.36.pdf
  • Filesize: 0.64 MB
  • 16 pages

Document Identifiers

Author Details

Ofer Neiman
  • Ben-Gurion University of the Negev, Beer-Sheva, Israel
Idan Shabat
  • Ben-Gurion University of the Negev, Beer-Sheva, Israel

Funding

Partially supported by the Lynn and William Frankel Center for Computer Sciences and ISF grant 970/21.

Acknowledgements

The second-name author would like to thank Michael Elkin, who also suggested to the second-name author that the pairwise spanner of [Shimon Kogan and Merav Parter, 2022] might be extended to a pairwise PRDO, and that a PRDO for unweighted graphs with size O (n^{1+1/k}) and stretch O(k²) can be achieved.

Cite AsGet BibTex

Ofer Neiman and Idan Shabat. Path-Reporting Distance Oracles with Linear Size. In 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 294, pp. 36:1-36:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.SWAT.2024.36

Abstract

Given an undirected weighted graph, an (approximate) distance oracle is a data structure that can (approximately) answer distance queries. A Path-Reporting Distance Oracle, or PRDO, is a distance oracle that must also return a path between the queried vertices. Given a graph on n vertices and an integer parameter k ≥ 1, Thorup and Zwick [M. Thorup and U. Zwick, 2001] showed a PRDO with stretch 2k-1, size O(k⋅n^{1+1/k}) and query time O(k) (for the query time of PRDOs, we omit the time needed to report the path itself). Subsequent works [Mendel and Naor, 2007; Shiri Chechik, 2014; Shiri Chechik, 2015] improved the size to O(n^{1+1/k}) and the query time to O(1). However, these improvements produce distance oracles which are not path-reporting. Several other works [Michael Elkin et al., 2016; Michael Elkin and Seth Pettie, 2016] focused on small size PRDO for general graphs, but all known results on distance oracles with linear size suffer from polynomial stretch, polynomial query time, or not being path-reporting. In this paper we devise the first linear size PRDO with poly-logarithmic stretch and low query time O(log log n). More generally, for any integer k ≥ 1, we obtain a PRDO with stretch at most O(k^4.82), size O(n^{1+1/k}), and query time O(log k). In addition, we can make the size of our PRDO as small as n+o(n), at the cost of increasing the query time to poly-logarithmic. For unweighted graphs, we improve the stretch to O(k²). We also consider pairwise PRDO, which is a PRDO that is only required to answer queries from a given set of pairs P. An exact PRDO of size O(n+|P|²) and constant query time was provided in [Michael Elkin and Seth Pettie, 2016]. In this work we dramatically improve the size, at the cost of slightly increasing the stretch. Specifically, given any ε > 0, we devise a pairwise PRDO with stretch 1+ε, constant query time, and near optimal size n^o(1)⋅ (n+|P|).

Subject Classification

ACM Subject Classification
  • Theory of computation → Shortest paths
Keywords
  • Graph Algorithms
  • Shortest Paths
  • Distance Oracles

Metrics

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

Related Versions

References

  1. MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Raimondas Kiveris, Silvio Lattanzi, and Vahab S. Mirrokni. Affinity clustering: Hierarchical clustering at scale. In Isabelle Guyon, Ulrike von Luxburg, Samy Bengio, Hanna M. Wallach, Rob Fergus, S. V. N. Vishwanathan, and Roman Garnett, editors, Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, December 4-9, 2017, Long Beach, CA, USA, pages 6864-6874, 2017. URL: https://proceedings.neurips.cc/paper/2017/hash/2e1b24a664f5e9c18f407b2f9c73e821-Abstract.html.
  2. Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrović, and Yasamin Nazari. Massively parallel algorithms for distance approximation and spanners. In Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, pages 118-128, 2021. Google Scholar
  3. Greg Bodwin. New results on linear size distance preservers. SIAM J. Comput., 50(2):662-673, 2021. URL: https://doi.org/10.1137/19M123662X.
  4. Greg Bodwin, Keerti Choudhary, Merav Parter, and Noa Shahar. New fault tolerant subset preservers. In Artur Czumaj, Anuj Dawar, and Emanuela Merelli, editors, 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference), volume 168 of LIPIcs, pages 15:1-15:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. URL: https://doi.org/10.4230/LIPIcs.ICALP.2020.15.
  5. Greg Bodwin, Gary Hoppenworth, and Ohad Trabelsi. Bridge girth: A unifying notion in network design. arXiv preprint, 2022. URL: https://arxiv.org/abs/2212.11944.
  6. Greg Bodwin and Virginia Vassilevska Williams. Better distance preservers and additive spanners. ACM Trans. Algorithms, 17(4):36:1-36:24, 2021. URL: https://doi.org/10.1145/3490147.
  7. Shiri Chechik. Approximate distance oracles with constant query time. In David B. Shmoys, editor, Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014, pages 654-663. ACM, 2014. URL: https://doi.org/10.1145/2591796.2591801.
  8. Shiri Chechik. Approximate distance oracles with improved bounds. In Rocco A. Servedio and Ronitt Rubinfeld, editors, Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015, pages 1-10. ACM, 2015. URL: https://doi.org/10.1145/2746539.2746562.
  9. D. Coppersmith and M. Elkin. Sparse source-wise and pair-wise distance preservers. In SODA: ACM-SIAM Symposium on Discrete Algorithms, pages 660-669, 2005. Google Scholar
  10. Marek Cygan, Fabrizio Grandoni, and Telikepalli Kavitha. On pairwise spanners. In Natacha Portier and Thomas Wilke, editors, 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, volume 20 of LIPIcs, pages 209-220. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. URL: https://doi.org/10.4230/LIPIcs.STACS.2013.209.
  11. Daniel Delling, Peter Sanders, Dominik Schultes, and Dorothea Wagner. Engineering route planning algorithms. In Jürgen Lerner, Dorothea Wagner, and Katharina Anna Zweig, editors, Algorithmics of Large and Complex Networks - Design, Analysis, and Simulation [DFG priority program 1126], volume 5515 of Lecture Notes in Computer Science, pages 117-139. Springer, 2009. URL: https://doi.org/10.1007/978-3-642-02094-0_7.
  12. Michael Elkin, Ofer Neiman, and Christian Wulff-Nilsen. Space-efficient path-reporting approximate distance oracles. Theor. Comput. Sci., 651:1-10, 2016. URL: https://doi.org/10.1016/j.tcs.2016.07.038.
  13. Michael Elkin and Seth Pettie. A linear-size logarithmic stretch path-reporting distance oracle for general graphs. ACM Trans. Algorithms, 12(4):50:1-50:31, 2016. URL: https://doi.org/10.1145/2888397.
  14. Michael Elkin and Idan Shabat. Path-reporting distance oracles with near-logarithmic stretch and linear size. CoRR, abs/2304.04445, 2023. URL: https://doi.org/10.48550/arXiv.2304.04445.
  15. P. Erdős. Extremal problems in graph theory. In Theory of Graphs and Applications (Proc. Sympos. Smolenice), pages 29-36, 1964. Google Scholar
  16. Mohsen Ghaffari and Bernhard Haeupler. Distributed algorithms for planar networks ii: Low-congestion shortcuts, mst, and min-cut. In Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms, pages 202-219. SIAM, 2016. Google Scholar
  17. Ning Jing, Yun-Wu Huang, and Elke A. Rundensteiner. Hierarchical optimization of optimal path finding for transportation applications. In CIKM '96, Proceedings of the Fifth International Conference on Information and Knowledge Management, November 12-16, 1996, Rockville, Maryland, USA, pages 261-268. ACM, 1996. URL: https://doi.org/10.1145/238355.238550.
  18. Telikepalli Kavitha. New pairwise spanners. Theory Comput. Syst., 61(4):1011-1036, 2017. URL: https://doi.org/10.1007/s00224-016-9736-7.
  19. Shimon Kogan and Merav Parter. Having hope in hops: New spanners, preservers and lower bounds for hopsets. In 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, October 31 - November 3, 2022, pages 766-777. IEEE, 2022. URL: https://doi.org/10.1109/FOCS54457.2022.00078.
  20. Manor Mendel and Assaf Naor. Ramsey partitions and proximity data structures. Journal of the European Mathematical Society, 9(2):253-275, 2007. Google Scholar
  21. Christian Sommer. Shortest-path queries in static networks. ACM Computing Surveys, 46:45:1-31, 2014. URL: https://doi.org/10.1145/2530531.
  22. M. Thorup and U. Zwick. Approximate distance oracles. In Proc. of the 33rd ACM Symp. on Theory of Computing, pages 183-192, 2001. Google Scholar
  23. Christian Wulff-Nilsen. Approximate distance oracles with improved query time. In Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms, pages 539-549. SIAM, 2013. Google Scholar
  24. Christos D. Zaroliagis. Engineering algorithms for large network applications. In Ming-Yang Kao, editor, Encyclopedia of Algorithms - 2008 Edition. Springer, 2008. URL: https://doi.org/10.1007/978-0-387-30162-4_125.
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact