Euclidean Steiner Spanners: Light and Sparse
Sujoy Bhore, Csaba D. Toth

TL;DR
This paper improves bounds on the lightness and sparsity of Euclidean Steiner $(1+ ext{varepsilon})$-spanners, providing new lower bounds in higher dimensions and matching upper bounds in the plane, using geometric insights and novel constructions.
Contribution
It establishes new lower bounds for lightness and sparsity in Euclidean Steiner spanners and presents tight upper bounds in the plane, advancing understanding of their optimal parameters.
Findings
Lower bounds of $oldsymbol{ ext{Omega}( ext{varepsilon}^{-d/2})}$ for lightness in $d$-space.
Lower bounds of $oldsymbol{ ext{Omega}( ext{varepsilon}^{-(d-1)/2})}$ for sparsity in $d$-space.
Existence of planar Steiner spanners with lightness $O( ext{varepsilon}^{-1})$, matching the lower bound.
Abstract
Lightness and sparsity are two natural parameters for Euclidean -spanners. Classical results show that, when the dimension and are constant, every set of points in -space admits an -spanners with edges and weight proportional to that of the Euclidean MST of . In a recent breakthrough, Le and Solomon (2019) established the precise dependencies on , for constant , of the minimum lightness and sparsity of -spanners, and observed that Steiner points can substantially improve the lightness and sparsity of a -spanner. They gave upper bounds of for the minimum lightness in dimensions , and for the minimum sparsity in -space for all . In this work,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Advanced Graph Theory Research · graph theory and CDMA systems
