Affiliation:
1. Ben-Gurion University of the Negev, Beer-Sheva, Israel
2. Weizmann Institute of Science, Rehovot, Israel
Abstract
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. [1995] devised a construction of Euclidean (1+ε)-spanners that achieves constant degree, diameter
O
(log
n
), weight
O
(log
2
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 [Dinitz et al. 2008; Agarwal et al. 2005].
In this article 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 trade-off 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.
Funder
ISF
BSF
Lynn and William Frankel Center for Computer Sciences
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Minimum weight Euclidean (1+ɛ)-spanners;European Journal of Combinatorics;2024-05
2. Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the Ω (log n) Lightness Barrier;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. A Unified Framework for Light Spanners;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
4. Greedy Spanners in Euclidean Spaces Admit Sublinear Separators;ACM Transactions on Algorithms;2023-04-03
5. Can't See the Forest for the Trees;Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing;2022-07-20