Document Open Access Logo

Light Spanners with Small Hop-Diameter

Authors Sujoy Bhore , Lazar Milenković

PDF

File

Thumbnail PDF
PDF
LIPIcs.ICALP.2025.30.pdf
  • Filesize: 0.83 MB
  • 16 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
Keywords
  • Geometric Spanners
  • Lightness
  • Hop-Diameter
  • Recurrences
  • Lower Bounds

Metrics

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

Abstract

Lightness, sparsity, and hop-diameter are the fundamental parameters of geometric spanners. Arya et al. [STOC'95] showed in their seminal work that there exists a construction of Euclidean (1+ε)-spanners with hop-diameter O(log n) and lightness O(log n). They also gave a general tradeoff of hop-diameter k and sparsity O(α_k(n)), where α_k is a very slowly growing inverse of an Ackermann-style function. The former combination of logarithmic hop-diameter and lightness is optimal due to the lower bound by Dinitz et al. [FOCS'08]. Later, Elkin and Solomon [STOC'13] generalized the light spanner construction to doubling metrics and extended the tradeoff for more values of hop-diameter k. In a recent line of work [SoCG'22, SoCG'23], Le et al. proved that the aforementioned tradeoff between the hop-diameter and sparsity is tight for every choice of hop-diameter k. A fundamental question remains: What is the optimal tradeoff between the hop-diameter and lightness for every value of k?
In this paper, we present a general framework for constructing light spanners with small hop-diameter. Our framework is based on tree covers. In particular, we show that if a metric admits a tree cover with γ trees, stretch t, and lightness L, then it also admits a t-spanner with hop-diameter k and lightness O(kn^{2/k}⋅ γ L). Further, we note that the tradeoff for trees is tight due to a construction in uniform line metric, which is perhaps the simplest tree metric. As a direct consequence of this framework, we obtain new tradeoffs between lightness and hop-diameter for doubling metrics.

Cite As Get BibTex

Sujoy Bhore and Lazar Milenković. Light Spanners with Small Hop-Diameter. In 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 334, pp. 30:1-30:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ICALP.2025.30

Author Details

Sujoy Bhore
  • Department of Computer Science and Engineering, Indian Institute of Technology Bombay, India
Lazar Milenković
  • Tel Aviv University, Israel

Funding

Lazar Milenković is supported by a grant from the United States-Israel Binational Science Foundation (BSF), Jerusalem, Israel, and the United States National Science Foundation (NSF).

References

  1. 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. URL: https://doi.org/10.1007/BF02189308.
  2. Sunil Arya, Gautam Das, David M Mount, Jeffrey S Salowe, and Michiel Smid. Euclidean spanners: short, thin, and lanky. In Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, pages 489-498, 1995. URL: https://doi.org/10.1145/225058.225191.
  3. Sunil Arya, David M Mount, and Michiel Smid. Randomized and deterministic algorithms for geometric spanners of small diameter. In Proc. 35th IEEE Symposium on Foundations of Computer Science (FOCS), pages 703-712, 1994. URL: https://doi.org/10.1109/SFCS.1994.365722.
  4. Sunil Arya and Michiel Smid. Efficient construction of a bounded-degree spanner with low weight. Algorithmica, 17(1):33-54, 1997. URL: https://doi.org/10.1007/BF02523237.
  5. Yair Bartal, Ora Nova Fandina, and Ofer Neiman. Covering metric spaces by few trees. Journal of Computer and System Sciences, 130:26-42, 2022. URL: https://doi.org/10.1016/J.JCSS.2022.06.001.
  6. Sujoy Bhore, Timothy M Chan, Zhengcheng Huang, Shakhar Smorodinsky, and Csaba D Toth. Sparse bounded-hop spanners for geometric intersection graphs. In 41st International Symposium on Computational Geometry, SoCG 2025, LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. Google Scholar
  7. Sujoy Bhore, Balázs Keszegh, Andrey Kupavskii, Hung Le, Alexandre Louvet, Dömötör Pálvölgyi, and Csaba D. Tóth. Spanners in planar domains via steiner spanners and non-steiner tree covers. In Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025, pages 4292-4326. SIAM, 2025. URL: https://doi.org/10.1137/1.9781611978322.145.
  8. Sujoy Bhore and Csaba D. Tóth. Light euclidean steiner spanners in the plane. In 37th International Symposium on Computational Geometry, SoCG 2021, June 7-11, 2021, Buffalo, NY, USA (Virtual Conference), volume 189 of LIPIcs, pages 15:1-15:17, 2021. URL: https://doi.org/10.4230/LIPICS.SOCG.2021.15.
  9. Sujoy Bhore and Csaba D. Tóth. On euclidean steiner (1+ε)-spanners. In 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, volume 187 of LIPIcs, pages 13:1-13:16, 2021. URL: https://doi.org/10.4230/LIPICS.STACS.2021.13.
  10. Sujoy Bhore and Csaba D. Tóth. Euclidean steiner spanners: Light and sparse. SIAM J. Discret. Math., 36(3):2411-2444, 2022. URL: https://doi.org/10.1137/22M1502707.
  11. Hans L. Bodlaender, Gerard Tel, and Nicola Santoro. Trade-offs in non-reversing diameter. Nord. J. Comput., 1(1):111-134, 1994. Google Scholar
  12. Glencora Borradaile, Hung Le, and Christian Wulff-Nilsen. Greedy spanners are optimal in doubling metrics. In Proc. 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2371-2379, 2019. URL: https://doi.org/10.1137/1.9781611975482.145.
  13. Paul B. Callahan. Optimal parallel all-nearest-neighbors using the well-separated pair decomposition. In Proc. 34th IEEE Symposium on Foundations of Computer Science (FOCS), pages 332-340, 1993. Google Scholar
  14. T-H Hubert Chan and Anupam Gupta. Small hop-diameter sparse spanners for doubling metrics. Discrete & Computational Geometry, 41:28-44, 2009. URL: https://doi.org/10.1007/S00454-008-9115-5.
  15. T-H Hubert Chan, Anupam Gupta, Bruce M Maggs, and Shuheng Zhou. On hierarchical routing in doubling metrics. ACM Transactions on Algorithms (TALG), 12(4):1-22, 2016. URL: https://doi.org/10.1145/2915183.
  16. Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, and Cuong Than. Covering planar metrics (and beyond): O (1) trees suffice. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pages 2231-2261. IEEE, 2023. URL: https://doi.org/10.1109/FOCS57990.2023.00139.
  17. Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, and Cuong Than. Optimal euclidean tree covers. In 40th International Symposium on Computational Geometry, SoCG 2024, June 11-14, 2024, Athens, Greece, volume 293 of LIPIcs, pages 37:1-37:15, 2024. URL: https://doi.org/10.4230/LIPICS.SOCG.2024.37.
  18. Hsien-Chih Chang, Jonathan Conroy, Hung Le, Lazar Milenkovic, Shay Solomon, and Cuong Than. Shortcut partitions in minor-free graphs: Steiner point removal, distance oracles, tree covers, and more. In SODA, pages 5300-5331. SIAM, 2024. URL: https://doi.org/10.1137/1.9781611977912.191.
  19. L. Paul Chew. There is a planar graph almost as good as the complete graph. In Proc. 2nd Symposium on Computational Geometry, pages 169-177. ACM Press, 1986. URL: https://doi.org/10.1145/10515.10534.
  20. Kenneth L. Clarkson. Approximation algorithms for shortest path motion planning. In Proc. 19th ACM Symposium on Theory of Computing (STOC), pages 56-65, 1987. Google Scholar
  21. Gautam Das, Paul Heffernan, and Giri Narasimhan. Optimally sparse spanners in 3-dimensional Euclidean space. In Proc. 9th Symposium on Computational Geometry (SoCG), pages 53-62. ACM Press, 1993. URL: https://doi.org/10.1145/160985.160998.
  22. Gautam Das, Giri Narasimhan, and Jeffrey Salowe. A new way to weigh malnourished euclidean graphs. In proceedings of the sixth annual ACM-SIAM symposium on discrete algorithms, pages 215-222, 1995. URL: http://dl.acm.org/citation.cfm?id=313651.313697.
  23. Gautam Das, Giri Narasimhan, and Jeffrey S. Salowe. A new way to weigh malnourished Euclidean graphs. In Proc. 6th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 215-222, 1995. URL: http://dl.acm.org/citation.cfm?id=313651.313697.
  24. Yefim Dinitz, Michael Elkin, and Shay Solomon. Low-light trees, and tight lower bounds for euclidean spanners. Discrete & Computational Geometry, 43:736-783, 2010. URL: https://doi.org/10.1007/S00454-009-9230-Y.
  25. Michael Elkin and Shay Solomon. Optimal euclidean spanners: Really short, thin, and lanky. J. ACM, 62(5):35:1-35:45, 2015. URL: https://doi.org/10.1145/2819008.
  26. Arnold Filtser, Yuval Gitlitz, and Ofer Neiman. Light, reliable spanners. In SoCG, volume 293 of LIPIcs, pages 56:1-56:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPICS.SOCG.2024.56.
  27. Arnold Filtser and Hung Le. Low treewidth embeddings of planar and minor-free metrics. In FOCS, pages 1081-1092. IEEE, 2022. URL: https://doi.org/10.1109/FOCS54457.2022.00105.
  28. Lee-Ad Gottlieb. A light metric spanner. In IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, pages 759-772. IEEE Computer Society, 2015. URL: https://doi.org/10.1109/FOCS.2015.52.
  29. Lee-Ad Gottlieb, Aryeh Kontorovich, and Robert Krauthgamer. Efficient regression in metric spaces via approximate Lipschitz extension. IEEE Transactions on Information Theory, 63(8):4838-4849, 2017. URL: https://doi.org/10.1109/TIT.2017.2713820.
  30. Joachim Gudmundsson, Christos Levcopoulos, and Giri Narasimhan. Fast greedy algorithms for constructing sparse geometric spanners. SIAM Journal on Computing, 31(5):1479-1500, 2002. URL: https://doi.org/10.1137/S0097539700382947.
  31. Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, and Michiel Smid. Approximate distance oracles for geometric spanners. ACM Transactions on Algorithms (TALG), 4(1):1-34, 2008. URL: https://doi.org/10.1145/1328911.1328921.
  32. Anupam Gupta, Amit Kumar, and Rajeev Rastogi. Traveling with a pez dispenser (or, routing issues in mpls). SIAM Journal on Computing, 34(2):453-474, 2005. URL: https://doi.org/10.1137/S0097539702409927.
  33. J. Mark Keil. Approximating the complete Euclidean graph. In Proc. 1st Scandinavian Workshop on Algorithm Theory (SWAT), volume 318 of LNCS, pages 208-213. Springer, 1988. URL: https://doi.org/10.1007/3-540-19487-8_23.
  34. J. Mark Keil and Carl A. Gutwin. Classes of graphs which approximate the complete Euclidean graph. Discrete & Computational Geometry, 7:13-28, 1992. URL: https://doi.org/10.1007/BF02187821.
  35. Robert Krauthgamer, James R. Lee, Manor Mendel, and Assaf Naor. Measured descent: A new embedding method for finite metrics. In FOCS, pages 434-443. IEEE Computer Society, 2004. URL: https://doi.org/10.1109/FOCS.2004.41.
  36. Hung Le, Lazar Milenkovic, and Shay Solomon. Sparse euclidean spanners with tiny diameter: A tight lower bound. In 38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany, volume 224 of LIPIcs, pages 54:1-54:15, 2022. URL: https://doi.org/10.4230/LIPICS.SOCG.2022.54.
  37. Hung Le, Lazar Milenkovic, and Shay Solomon. Sparse euclidean spanners with optimal diameter: A general and robust lower bound via a concave inverse-ackermann function. In 39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA, volume 258 of LIPIcs, pages 47:1-47:17, 2023. URL: https://doi.org/10.4230/LIPICS.SOCG.2023.47.
  38. Hung Le and Shay Solomon. Truly optimal Euclidean spanners. In Proc. 60th IEEE Symposium on Foundations of Computer Science (FOCS), pages 1078-1100, 2019. URL: https://doi.org/10.1109/FOCS.2019.00069.
  39. Manor Mendel and Assaf Naor. Ramsey partitions and proximity data structures. Journal of the European Mathematical Society, 9(2):253-275, 2007. Google Scholar
  40. Assaf Naor and Terence Tao. Scale-oblivious metric fragmentation and the nonlinear dvoretzky theorem. Israel Journal of Mathematics, 192:489-504, 2012. Google Scholar
  41. Giri Narasimhan and Michiel Smid. Geometric Spanner Networks. Cambridge University Press, 2007. Google Scholar
  42. Satish B. Rao and Warren D. Smith. Approximating geometrical graphs via “spanners” and “banyans”. In Proc. 13th ACM Symposium on Theory of Computing (STOC), pages 540-550, 1998. Google Scholar
  43. Jim Ruppert and Raimund Seidel. Approximating the d-dimensional complete Euclidean graph. In Proc. 3rd Canadian Conference on Computational Geometry (CCCG), pages 207-210, 1991. Google Scholar
  44. Christian Schindelhauer, Klaus Volbert, and Martin Ziegler. Geometric spanners with applications in wireless networks. Comput. Geom., 36(3):197-214, 2007. URL: https://doi.org/10.1016/J.COMGEO.2006.02.001.
  45. Shay Solomon. Sparse euclidean spanners with tiny diameter. ACM Trans. Algorithms, 9(3):28:1-28:33, 2013. URL: https://doi.org/10.1145/2483699.2483708.
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-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact