Light Euclidean Steiner Spanners in the Plane

  title={Light Euclidean Steiner Spanners in the Plane},
  author={Sujoy Kumar Bhore and Csaba D. T'oth},
Lightness is a fundamental parameter for Euclidean spanners; it is the ratio of the spanner weight to the weight of the minimum spanning tree of a finite set of points in $\mathbb{R}^d$. In a recent breakthrough, Le and Solomon (2019) established the precise dependencies on $\varepsilon>0$ and $d\in \mathbb{N}$ of the minimum lightness of an $(1+\varepsilon)$-spanner, and observed that additional Steiner points can substantially improve the lightness. Le and Solomon (2020) constructed Steiner… 

A Unified Framework of Light Spanners II: Fine-Grained Optimality

This work presents a unified framework of light spanners in a variety of graph classes, and complements the upper bound with a highly nontrivial lower bound construction, for which any (1 + )-spanner must have lightness Ω( r + 1 2 ).

Minimum Weight Euclidean $(1+\varepsilon)$-Spanners

The result generalizes to d -space for all d ∈ N : The minimum weight of a Euclidean (1 + ε )-spanner for n points in the unit cube d is O d ( ε (1 − d 2 ) /d n ( d − 1) /d ), and this bound is the best possible.

Euclidean Steiner Spanners: Light and Sparse

This work improves several bounds on the lightness and sparsity of Euclidean Steiner (1 + ε )-spanners, and generalizes the notion of shallow light trees, which may be of independent interest, and use directional spanners and a modified window partitioning scheme to achieve a tight weight analysis.

Online Spanners in Metric Spaces

Given a metric space M = ( X, δ ), a weighted graph G over X is a metric t -spanner of M if for every u, v ∈ X , δ ( u, v ) ≤ δ G ( u, v ) ≤ t · δ ( u, v ), where δ G is the shortest path metric in G

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP

This work revisits the classic task of finding the shortest tour of $n$ points in d-dimensional Euclidean space, and builds upon the celebrated quadtree-based methods initially proposed by Arora, but adds a new idea that is sparsity-sensitive patching that lets the granularity with which the tour depends on how sparse it is locally.

Online Euclidean Spanners

It is proved that any online spanner algorithm for a sequence of n points in ℝ^d under the L₂ norm has competitive ratio Ω(f(n), where lim_{n → ∞} f(n) = ∞.



Light Euclidean Spanners with Steiner Points

The FOCS'19 paper of Le and Solomon, culminating a long line of research on Euclidean spanners, proves that the lightness (normalized weight) of the greedy $(1+\epsilon)$-spanner in $\mathbb{R}^d$ is

On Euclidean Steiner $(1+\epsilon)$-Spanners

Using a new geometric analysis, several bounds on the lightness and sparsity of Euclidean Steiner Steiner $(1+\epsilon)$-spanners are improved.

Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones

This paper shows that using Steiner points one can build SLTs with logarithmic lightness, i.e., $\beta = O(\log \frac{1}{\epsilon})$ on the lightness of SLTs, and establishes an \emph{exponential separation} between spanning SLTs and Steiner ones.

Greedy spanners are optimal in doubling metrics

We show that the greedy spanner algorithm constructs a $(1+\epsilon)$-spanner of weight $\epsilon^{-O(d)}w(\mathrm{MST})$ for a point set in metrics of doubling dimension $d$, resolving an open

Truly Optimal Euclidean Spanners

  • Hung LeShay Solomon
  • Computer Science, Mathematics
    2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2019
It is shown that any (1+ε) -spanner must have lightness Ω(ε^-d), and the upper bound on the lightness of the greedy spanner is improved, implying that the greedy (and other) spanners achieve the optimal size.

On Euclidean Steiner (1+ε)-Spanners

Lower bounds are established on the lightness and sparsity of Euclidean Steiner (1 + ε)-spanners of lightness O(ε−1 log n) for n points in Euclidan plane using the geometric insight from the lower bound analysis.

On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems

  • A. Yao
  • Mathematics, Computer Science
    SIAM J. Comput.
  • 1982
By employing a subroutine that solves the post office problem, it is shown that, for fixed k $\geq$ 3, such a minimum spanning tree can be found in time O($n^{2-a(k)} {(log n)}^{1-a (k)}$), where a(k) = $2^{-(k+1)}$.

Fast Greedy Algorithms for Constructing Sparse Geometric Spanners

The first O(nlog n)-time algorithm to compute a geometric t-spanner on V, a connected graph G = (V,E) with edge weights equal to the Euclidean distances between the endpoints, and its degree is bounded by a constant.

Near-Optimal Light Spanners

A spanner H of a weighted undirected graph G is a “sparse” subgraph that approximately preserves distances between every pair of vertices in G for some parameter δ ≥ 1 if the distance in H between every vertex pair is at most a factor δ bigger than in G.