TY - GEN
T1 - Optimal euclidean spanners
T2 - 45th Annual ACM Symposium on Theory of Computing, STOC 2013
AU - Elkin, Michael
AU - Solomon, Shay
PY - 2013/7/11
Y1 - 2013/7/11
N2 - The degree, the (hop-)diameter, and the weight are the most basic and well-studied parameters of geometric spanners. In a seminal STOC'95 paper, titled"Euclidean spanners: short, thin and lanky", Arya et al. [2] devised a construction of Euclidean (1 + ε)-spanners that achieves constant degree, diameter O(log n), weight O(log2 n) ·Ω(MST), and has running time O(n · log n). This construction applies to n-point constant-dimensional Euclidean spaces. Moreover, Arya et al. conjectured that the weight bound can be improved by a logarithmic factor, without increasing the degree and the diameter of the spanner, and within the same running time. This conjecture of Arya et al. became one of the most central open problems in the area of Euclidean spanners. Nevertheless, the only progress since 1995 towards its resolution was achieved in the lower bounds front: Any spanner with diameter O(log n) must incur weight Ω(log n)·Ω(MST), and this lower bound holds regardless of the stretch or the degree of the spanner [12, 1]. In this paper we resolve the long-standing conjecture of Arya et al. in the affirmative. We present a spanner construction with the same stretch, degree, diameter, and running time, as in Arya et al.'s result, but with optimal weight O(log n) · Ω(MST). So our spanners are as thin and lanky as those of Arya et al., but they are really short! Moreover, our result is more general in three ways. First, we demonstrate that the conjecture holds true not only in constant-dimensional Euclidean spaces, but also in doubling metrics. Second, we provide a general tradeoff between the three involved parameters, which is tight in the entire range. Third, we devise a transformation that decreases the lightness of spanners in general metrics, while keeping all their other parameters in check. Our main result is obtained as a corollary of this transformation.
AB - The degree, the (hop-)diameter, and the weight are the most basic and well-studied parameters of geometric spanners. In a seminal STOC'95 paper, titled"Euclidean spanners: short, thin and lanky", Arya et al. [2] devised a construction of Euclidean (1 + ε)-spanners that achieves constant degree, diameter O(log n), weight O(log2 n) ·Ω(MST), and has running time O(n · log n). This construction applies to n-point constant-dimensional Euclidean spaces. Moreover, Arya et al. conjectured that the weight bound can be improved by a logarithmic factor, without increasing the degree and the diameter of the spanner, and within the same running time. This conjecture of Arya et al. became one of the most central open problems in the area of Euclidean spanners. Nevertheless, the only progress since 1995 towards its resolution was achieved in the lower bounds front: Any spanner with diameter O(log n) must incur weight Ω(log n)·Ω(MST), and this lower bound holds regardless of the stretch or the degree of the spanner [12, 1]. In this paper we resolve the long-standing conjecture of Arya et al. in the affirmative. We present a spanner construction with the same stretch, degree, diameter, and running time, as in Arya et al.'s result, but with optimal weight O(log n) · Ω(MST). So our spanners are as thin and lanky as those of Arya et al., but they are really short! Moreover, our result is more general in three ways. First, we demonstrate that the conjecture holds true not only in constant-dimensional Euclidean spaces, but also in doubling metrics. Second, we provide a general tradeoff between the three involved parameters, which is tight in the entire range. Third, we devise a transformation that decreases the lightness of spanners in general metrics, while keeping all their other parameters in check. Our main result is obtained as a corollary of this transformation.
KW - Doubling metrics
KW - Euclidean spaces
KW - Euclidean spanners
UR - http://www.scopus.com/inward/record.url?scp=84879811343&partnerID=8YFLogxK
U2 - 10.1145/2488608.2488691
DO - 10.1145/2488608.2488691
M3 - Conference contribution
SN - 9781450320290
T3 - Proceedings of the Annual ACM Symposium on Theory of Computing
SP - 645
EP - 654
BT - STOC 2013 - Proceedings of the 2013 ACM Symposium on Theory of Computing
Y2 - 1 June 2013 through 4 June 2013
ER -