Document Open Access Logo

On Euclidean Steiner (1+ε)-Spanners

Authors Sujoy Bhore , Csaba D. Tóth

Thumbnail PDF


  • Filesize: 0.9 MB
  • 16 pages

Document Identifiers

Author Details

Sujoy Bhore
  • Université Libre de Bruxelles, Brussels, Belgium
Csaba D. Tóth
  • California State University Northridge, Los Angeles, CA, USA
  • Tufts University, Medford, MA, USA

Cite AsGet BibTex

Sujoy Bhore and Csaba D. Tóth. On Euclidean Steiner (1+ε)-Spanners. In 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 187, pp. 13:1-13:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)


Lightness and sparsity are two natural parameters for Euclidean (1+ε)-spanners. Classical results show that, when the dimension d ∈ ℕ and ε > 0 are constant, every set S of n points in d-space admits an (1+ε)-spanners with O(n) edges and weight proportional to that of the Euclidean MST of S. Tight bounds on the dependence on ε > 0 for constant d ∈ ℕ have been established only recently. Le and Solomon (FOCS 2019) showed that Steiner points can substantially improve the lightness and sparsity of a (1+ε)-spanner. They gave upper bounds of Õ(ε^{-(d+1)/2}) for the minimum lightness in dimensions d ≥ 3, and Õ(ε^{-(d-1))/2}) for the minimum sparsity in d-space for all d ≥ 1. They obtained lower bounds only in the plane (d = 2). Le and Solomon (ESA 2020) also constructed Steiner (1+ε)-spanners of lightness O(ε^{-1}logΔ) in the plane, where Δ ∈ Ω(log n) is the spread of S, defined as the ratio between the maximum and minimum distance between a pair of points. In this work, we improve several bounds on the lightness and sparsity of Euclidean Steiner (1+ε)-spanners. Using a new geometric analysis, we establish lower bounds of Ω(ε^{-d/2}) for the lightness and Ω(ε^{-(d-1)/2}) for the sparsity of such spanners in Euclidean d-space for all d ≥ 2. We use the geometric insight from our lower bound analysis to construct Steiner (1+ε)-spanners of lightness O(ε^{-1}log n) for n points in Euclidean plane.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Approximation algorithms
  • Mathematics of computing → Paths and connectivity problems
  • Theory of computation → Computational geometry
  • Geometric spanner
  • (1+ε)-spanner
  • lightness
  • sparsity
  • minimum weight


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


  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:
  2. 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:
  3. Sunil Arya and Michiel Smid. Efficient construction of a bounded-degree spanner with low weight. Algorithmica, 17(1):33-54, 1997. URL:
  4. Sujoy Bhore and Csaba D. Tóth. Light Euclidean Steiner spanners in the plane. Preprint, 2020. URL:
  5. 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:
  6. Prosenjit Bose, Joachim Gudmundsson, and Michiel Smid. Constructing plane spanners of bounded degree and low weight. Algorithmica, 42(3-4):249-264, 2005. URL:
  7. 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. URL:
  8. T.-H. Hubert Chan, Mingfei Li, Li Ning, and Shay Solomon. New doubling spanners: Better and simpler. SIAM J. Comput., 44(1):37-53, 2015. URL:
  9. 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:
  10. L. Paul Chew. There are planar graphs almost as good as the complete graph. J. Comput. Syst. Sci., 39(2):205-219, 1989. URL:
  11. Kenneth L. Clarkson. Approximation algorithms for shortest path motion planning. In Proc. 19th ACM Symposium on Theory of Computing (STOC), pages 56-65, 1987. URL:
  12. 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:
  13. Gautam Das and Deborah Joseph. Which triangulations approximate the complete graph? In Proc. International Symposium on Optimal Algorithms, pages 168-192. Springer, 1989. URL:
  14. 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:
  15. Mark de Berg and Marc J. van Kreveld. Rectilinear decompositions with low stabbing number. Information Processing Letters, 52(4):215-221, 1994. URL:
  16. Michael J. Demmer and Maurice P. Herlihy. The arrow distributed directory protocol. In Proc. 12th Symposium on Distributed Computing (DISC), volume 1499 of LNCS, pages 119-133. Springer, 1998. URL:
  17. Adrian Dumitrescu and Csaba D. Tóth. Minimum weight convex Steiner partitions. Algorithmica, 60(3):627-652, 2011. URL:
  18. Herbert Edelsbrunner, Joseph O'Rourke, and Emmerich Welzl. Stationing guards in rectilinear art galleries. Computer Vision, Graphics, and Image Processing, 27(2):167-176, 1984. URL:
  19. Michael Elkin and Shay Solomon. Steiner shallow-light trees are exponentially lighter than spanning ones. SIAM J. Comput., 44(4):996-1025, 2015. URL:
  20. L. Few. The shortest path and the shortest road through n points. Mathematika, 2(2):141-144, 1955. URL:
  21. 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:
  22. Joachim Gudmundsson, Christos Levcopoulos, and Giri Narasimhan. Fast greedy algorithms for constructing sparse geometric spanners. SIAM J. Comput., 31(5):1479-1500, 2002. URL:
  23. 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:
  24. Maurice Herlihy, Srikanta Tirthapura, and Rogert Wattenhofer. Competitive concurrent distributed queuing. In Proc. 20th ACM Symposium on Principles of Distributed Computing (PODC), pages 127-133, 2001. URL:
  25. 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:
  26. J. Mark Keil and Carl A. Gutwin. Classes of graphs which approximate the complete Euclidean graph. Discrete & Computational Geometry, 7:13-28, 1992. URL:
  27. 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:
  28. Hung Le and Shay Solomon. Light Euclidean spanners with Steiner points. In Proc. 28th European Symposium on Algorithms (ESA), volume 173 of LIPIcs, pages 67:1-67:22. Schloss Dagstuhl, 2020. URL:
  29. Hung Le and Shay Solomon. Light Euclidean spanners with Steiner points. Preprint, 2020. Version 2. URL:
  30. Hung Le and Shay Solomon. A unified and fine-grained approach for light spanners. Preprint, 2020. URL:
  31. Christos Levcopoulos. Heuristics for Minimum Decompositions of Polygons. PhD thesis, Linköping, 1987. No. 74 of Linköping Studies in Science and Technology. Google Scholar
  32. Anil Maheshwari, Jörg-Rüdiger Sack, and Hristo N. Djidjev. Link distance problems. In Jörg-Rüdiger Sacks and Jorge Urutia, editors, Handbook of Computational Geometry, chapter 12, pages 519-558. North-Holland, 2000. URL:
  33. Giri Narasimhan and Michiel Smid. Geometric Spanner Networks. Cambridge University Press, 2007. URL:
  34. David Peleg and Jeffrey D. Ullman. An optimal synchronizer for the hypercube. SIAM J. Comput., 18(4):740-747, 1989. URL:
  35. David Peleg and Eli Upfal. A trade-off between space and efficiency for routing tables. Journal of the ACM (JACM), 36(3):510-530, 1989. URL:
  36. 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. URL:
  37. 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
  38. Christian Schindelhauer, Klaus Volbert, and Martin Ziegler. Geometric spanners with applications in wireless networks. Computational Geometry, 36(3):197-214, 2007. URL:
  39. Shay Solomon. Euclidean Steiner shallow-light trees. J. Comput. Geom., 6(2):113-139, 2015. URL:
  40. J. Michael Steele and Timothy Law Snyder. Worst-case growth rates of some classical problems of combinatorial optimization. SIAM J. Comput., 18(2):278-287, 1989. URL:
  41. Subhash Suri. On some link distance problems in a simple polygon. IEEE Trans. Robotics Autom., 6(1):108-113, 1990. URL:
  42. Andrew Chi-Chih Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comput., 11(4):721-736, 1982. URL:
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail