Skip to main navigation Skip to search Skip to main content

TRULY OPTIMAL EUCLIDEAN SPANNERS

  • Hung Le
  • , Shay Solomon

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

Euclidean spanners are important geometric structures, having found numerous applications over the years. Cornerstone results in this area from the late 1980s and early 1990s state that for any d-dimensional n-point Euclidean space, there exists a (1 + ε)-spanner with n . O(ε―d+1) edges and lightness (normalized weight) O(ε2d). Surprisingly, the fundamental question of whether or not these dependencies on ε and d for small d can be improved has remained elusive, even for d = 2. This question naturally arises in any application of Euclidean spanners where precision is a necessity (thus ε is tiny). In the most extreme case ε is inverse polynomial in n, and then one could potentially improve the size and lightness bounds by factors that are polynomial in n. The state-of-the-art bounds n . O(ε―d+1) and O(ε2d) on the size and lightness of spanners are realized by the greedy spanner. In 2016, in a preliminary version, Filtser and Solomon [SIAM J. Comput., 49 (2020), pp. 429-447] proved that, in low-dimensional spaces, the greedy spanner is ``near-optimal""; informally, their result states that the greedy spanner for dimension d is just as sparse and light as any other spanner but for dimension larger by a constant factor. Hence the question of whether the greedy spanner is truly optimal remained open to date. The contribution of this paper is twofold: (1) We resolve these longstanding questions by nailing down the dependencies on ε and d and showing that the greedy spanner is truly optimal. Specifically, for any d = O(1), ε = Ω (Formula presented), (a) we show 1 that there are n-point sets in ℝd for which any (1+ε)-spanner must have n.Ω(ε―d+1) edges, implying that the greedy (and other) spanners achieve the optimal size; (b) we show that there are n-point sets in ℝd for which any (1 + ε)-spanner must have lightness Ω(ε―d), and then improve the upper bound on the lightness of the greedy spanner from O(ε2d) to O(ε―d log(ε1)). (The lightness upper and lower bounds match up to a lower-order term.) (2) We then complement our negative result for the size of spanners with a rather counterintuitive positive result: Steiner points lead to a quadratic improvement in the size of spanners! Our bound for the size of Steiner spanners in ℝ2 is tight as well (up to a lower-order term).

Original languageEnglish
Pages (from-to)FOCS19135-FOCS19199
JournalSIAM Journal on Computing
Volume54
Issue number4
DOIs
StatePublished - 1 Jan 2025
Externally publishedYes

Keywords

  • Euclidean spanners
  • Steiner spanners
  • light spanners
  • spherical codes

ASJC Scopus subject areas

  • General Computer Science
  • General Mathematics

Fingerprint

Dive into the research topics of 'TRULY OPTIMAL EUCLIDEAN SPANNERS'. Together they form a unique fingerprint.

Cite this