Document Open Access Logo

Additive Spanner Lower Bounds with Optimal Inner Graph Structure

Authors Greg Bodwin , Gary Hoppenworth , Virginia Vassilevska Williams , Nicole Wein , Zixuan Xu

PDF
Thumbnail PDF

File

LIPIcs.ICALP.2024.28.pdf
  • Filesize: 0.86 MB
  • 17 pages

Document Identifiers

Author Details

Greg Bodwin
  • University of Michigan, Ann Arbor, MI, USA
Gary Hoppenworth
  • University of Michigan, Ann Arbor, Mi, USA
Virginia Vassilevska Williams
  • Massachusetts Institute of Technology, Cambridge, MA, USA
Nicole Wein
  • University of Michigan, Ann Arbor, MI, USA
Zixuan Xu
  • Massachusetts Institute of Technology, Cambridge, MA, USA

Funding

Greg Bodwin and Gary Hoppenworth: Supported by NSF:AF 2153680.
  • Vassilevska Williams, Virginia: Supported by NSF Grant CCF-2330048, BSF Grant 2020356 and a Simons Investigator Award.
  • Xu, Zixuan: Partially supported by NSF Grant CCF-2330048.

Cite AsGet BibTex

Greg Bodwin, Gary Hoppenworth, Virginia Vassilevska Williams, Nicole Wein, and Zixuan Xu. Additive Spanner Lower Bounds with Optimal Inner Graph Structure. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 28:1-28:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ICALP.2024.28

Abstract

We construct n-node graphs on which any O(n)-size spanner has additive error at least +Ω(n^{3/17}), improving on the previous best lower bound of Ω(n^{1/7}) [Bodwin-Hoppenworth FOCS '22]. Our construction completes the first two steps of a particular three-step research program, introduced in prior work and overviewed here, aimed at producing tight bounds for the problem by aligning aspects of the upper and lower bound constructions. More specifically, we develop techniques that enable the use of inner graphs in the lower bound framework whose technical properties are provably tight with the corresponding assumptions made in the upper bounds. As an additional application of our techniques, we improve the corresponding lower bound for O(n)-size additive emulators to +Ω(n^{1/14}).

Subject Classification

ACM Subject Classification
  • Theory of computation → Sparsification and spanners
Keywords
  • Additive Spanners
  • Graph Theory

Metrics

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

Related Versions

References

  1. Amir Abboud and Greg Bodwin. The 4/3 additive spanner exponent is tight. Journal of the ACM (JACM), 64(4):1-20, 2017. Google Scholar
  2. Amir Abboud, Greg Bodwin, and Seth Pettie. A hierarchy of lower bounds for sublinear additive spanners. SIAM Journal on Computing, 47(6):2203-2236, 2018. Google Scholar
  3. Donald Aingworth, Chandra Chekuri, Piotr Indyk, and Rajeev Motwani. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM Journal on Computing, 28(4):1167-1181, 1999. Google Scholar
  4. Ingo Althöfer, Gautam Das, David Dobkin, Deborah Joseph, and José Soares. On sparse spanners of weighted graphs. Discrete & Computational Geometry, 9(1):81-100, 1993. Google Scholar
  5. Imre Bárány and David G. Larman. The convex hull of the integer points in a large ball. Math. Ann., 312(1):167-181, 1998. URL: https://doi.org/10.1007/s002080050217.
  6. Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, and Seth Pettie. Additive spanners and (α, β)-spanners. ACM Transactions on Algorithms (TALG), 7(1):1-26, 2010. Google Scholar
  7. Greg Bodwin and Gary Hoppenworth. New additive spanner lower bounds by an unlayered obstacle product. In 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, October 31 - November 3, 2022, pages 778-788. IEEE, 2022. URL: https://doi.org/10.1109/FOCS54457.2022.00079.
  8. Greg Bodwin and Virginia Vassilevska Williams. Better distance preservers and additive spanners. ACM Transactions on Algorithms (TALG), 17(4):1-24, 2021. Google Scholar
  9. Gregory Bodwin and Virginia Vassilevska Williams. Very sparse additive spanners and emulators. In Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, pages 377-382, 2015. Google Scholar
  10. Béla Bollobás, Don Coppersmith, and Michael Elkin. Sparse distance preservers and additive spanners. SIAM Journal on Discrete Mathematics, 19(4):1029-1055, 2005. Google Scholar
  11. Shiri Chechik. New additive spanners. In Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms, pages 498-512. SIAM, 2013. Google Scholar
  12. Don Coppersmith and Michael Elkin. Sparse sourcewise and pairwise distance preservers. SIAM J. Discret. Math., 20(2):463-501, February 2006. URL: https://doi.org/10.1137/050630696.
  13. Dorit Dor, Shay Halperin, and Uri Zwick. All-pairs almost shortest paths. SIAM Journal on Computing, 29(5):1740-1759, 2000. Google Scholar
  14. William Hesse. Directed graphs requiring large numbers of shortcuts. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '03, pages 665-669, USA, 2003. Society for Industrial and Applied Mathematics. Google Scholar
  15. Gary Hoppenworth. Simple linear-size additive emulators. In 2024 Symposium on Simplicity in Algorithms (SOSA), pages 1-8. SIAM, 2024. Google Scholar
  16. Shang-En Huang and Seth Pettie. Lower Bounds on Sparse Spanners, Emulators, and Diameter-reducing shortcuts. In David Eppstein, editor, 16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), volume 101 of Leibniz International Proceedings in Informatics (LIPIcs), pages 26:1-26:12, Dagstuhl, Germany, 2018. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.SWAT.2018.26.
  17. Shimon Kogan and Merav Parter. New additive emulators. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. Google Scholar
  18. Kevin Lu. New methods for approximating shortest paths. PhD thesis, Massachusetts Institute of Technology, 2019. Google Scholar
  19. Kevin Lu, Virginia Vassilevska Williams, Nicole Wein, and Zixuan Xu. Better lower bounds for shortcut sets and additive spanners via an improved alternation product. In Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 3311-3331, 2022. Google Scholar
  20. Seth Pettie. Low distortion spanners. ACM Transactions on Algorithms (TALG), 6(1):1-22, 2009. Google Scholar
  21. Zihan Tan and Tianyi Zhang. Almost-optimal sublinear additive spanners. arXiv preprint, 2023. URL: https://arxiv.org/abs/2303.12768.
  22. Virginia Vassilevska Williams, Yinzhan Xu, and Zixuan Xu. Simpler and higher lower bounds for shortcut sets. In David P. Woodruff, editor, Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024, pages 2643-2656. SIAM, 2024. URL: https://doi.org/10.1137/1.9781611977912.94.
  23. David P Woodruff. Lower bounds for additive spanners, emulators, and more. In 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pages 389-398. IEEE, 2006. Google Scholar
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
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact