Truly Optimal Euclidean Spanners
Hung Le, Shay Solomon

TL;DR
This paper proves that the greedy Euclidean spanner is truly optimal in size and lightness for fixed dimensions and small epsilon, and shows Steiner points can significantly reduce spanner size.
Contribution
It establishes exact lower bounds matching the greedy spanner's upper bounds and demonstrates Steiner points can quadratically improve spanner size.
Findings
Greedy spanner size bounds are optimal.
Lightness of spanners is tightly bounded by psilon^{-d}.
Steiner points enable quadratic size reductions.
Abstract
Euclidean spanners are important geometric structures, having found numerous applications over the years. Cornerstone results in this area from the late 80s and early 90s state that for any -dimensional -point Euclidean space, there exists a -spanner with edges and lightness . Surprisingly, the fundamental question of whether or not these dependencies on and for small can be improved has remained elusive, even for . This question naturally arises in any application of Euclidean spanners where precision is a necessity. The state-of-the-art bounds and on the size and lightness of spanners are realized by the {\em greedy} spanner. In 2016, Filtser and Solomon proved that, in low dimensional spaces, the greedy spanner is near-optimal. The question of whether the…
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 · Optimization and Packing Problems · Advanced Graph Theory Research
