Light Euclidean Spanners with Steiner Points
Abstract
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 -spanner in is for any and any (where hides polylogarithmic factors of ), and also shows the existence of point sets in for which any -spanner must have lightness . Given this tight bound on the lightness, a natural arising question is whether a better lightness bound can be achieved using Steiner points. Our first result is a construction of Steiner spanners in with lightness , where is the spread of the point set. In the regime of , this provides an improvement over the lightness bound of Le and Solomon [FOCS 2019]; this regime of parameters is of practical interest, as point sets arising in real-life applications (e.g., for various random distributions) have polynomially bounded spread, while in spanner applications often controls the precision, and it sometimes needs to be much smaller than . Moreover, for spread polynomially bounded in , this upper bound provides a quadratic improvement over the non-Steiner bound of Le and Solomon [FOCS 2019], We then demonstrate that such a light spanner can be constructed in time for polynomially bounded spread, where hides a factor of . Finally, we extend the construction to higher dimensions, proving a lightness upper bound of for any and any .
Cite
@article{arxiv.2007.11636,
title = {Light Euclidean Spanners with Steiner Points},
author = {Hung Le and Shay Solomon},
journal= {arXiv preprint arXiv:2007.11636},
year = {2020}
}
Comments
Add comments on reducing log(spread) to log(n)