From Hierarchical Partitions to Hierarchical Covers: Optimal Fault-Tolerant Spanners for Doubling Metrics
Shay Solomon

TL;DR
This paper introduces an optimal fault-tolerant spanner construction for doubling metrics using a novel hierarchical cover approach, improving upon previous methods and settling key open questions in the field.
Contribution
It presents the first optimal fault-tolerant spanner construction for doubling metrics based on hierarchical covers, with improved diameter and weight guarantees.
Findings
Constructs $k$-fault-tolerant $(1+\eps)$-spanners with degree $O(k)$
Achieves diameter $O(\log n)$ and weight $O(k^2 + k \log n) \cdot \omega(MST)$
Runs in optimal time $O(n \log n + kn)$
Abstract
In this paper we devise an optimal construction of fault-tolerant spanners for doubling metrics. Specifically, for any -point doubling metric, any , and any integer , our construction provides a -fault-tolerant -spanner with optimal degree within optimal time . We then strengthen this result to provide near-optimal (up to a factor of ) guarantees on the diameter and weight of our spanners, namely, diameter and weight , while preserving the optimal guarantees on the degree and the running time . Our result settles several fundamental open questions in this area, culminating a long line of research that started with the STOC'95 paper of Arya et al.\ and the STOC'98 paper of Levcopoulos et al. On the way to this result we develop a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Complexity and Algorithms in Graphs · Data Management and Algorithms
