Euclidean Steiner Spanners: Light and Sparse

Lightness and sparsity are two natural parameters for Euclidean (1+) -spanners. Classical results show that, when the dimension d N and >0 are constant, every set S of n points in d-space admits a (1+) -spanner with O (n) edges and weight proportional to that of the Euclidean minimum spanning tree of S. In a recent breakthrough, Le and Solomon Proceedings of FOCS, 2019, pp. 1078--1100 established the precise dependencies on >0, for constant d N, of the minimum lightness and sparsity of (1+) -spanners, and observed that Steiner points can substantially improve the lightness and sparsity of a (1+) -spanner. They gave upper bounds of O (^- (d+1) /2) for the minimum lightness in dimensions d 3 and O (^- (d-1) /2) for the minimum sparsity in d-space for all d 1. Subsequently, Le and Solomon LIPIcs Leibniz Int. Proc. Inform. 173, Schloss Dagstuhl, Wadern, 2020, pp. 67: 1--67: 22 constructed Steiner (1+) -spanners of lightness O (^-1) in the plane, where (n) is the spread of S, defined as the ratio between the maximum and the minimum distance between a pair of points. In this work, we improve several bounds on the lightness and sparsity of Euclidean Steiner (1+) -spanners. 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 constant d 2. Our lower bound constructions generalize previous constructions by Le and Solomon, but the analysis substantially simplifies previous work, using new geometric insight, focusing on the directions of edges. Next, we show that for every finite set of points in the plane and every (0, 1], there exists a Euclidean Steiner (1+) -spanner of lightness O (^-1) ; this matches the lower bound for d=2. We generalize 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.