Light, Reliable Spanners

A \emph{$ν$-reliable spanner} of a metric space $(X,d)$, is a (dominating) graph $H$, such that for any possible failure set $B\subseteq X$, there is a set $B^+$ just slightly larger $|B^+|\le(1+ν)\cdot|B|$, and all distances between pairs in $X\setminus B^+$ are (approximately) preserved in $H\setminus B$. Recently, there have been several works on sparse reliable spanners in various settings, but so far, the weight of such spanners has not been analyzed at all. In this work, we initiate the study of \emph{light} reliable spanners, whose weight is proportional to that of the Minimum Spanning Tree (MST) of $X$. We first observe that unlike sparsity, the lightness of any deterministic reliable spanner is huge, even for the metric of the simple path graph. Therefore, randomness must be used: an \emph{oblivious} reliable spanner is a distribution over spanners, and the bound on $|B^+|$ holds in expectation. We devise an oblivious $ν$-reliable $(2+\frac{2}{k-1})$-spanner for any $k$-HST, whose lightness is $\approx ν^{-2}$. We demonstrate a matching $Ω(ν^{-2})$ lower bound on the lightness (for any finite stretch). We also note that any stretch below 2 must incur linear lightness. For general metrics, doubling metrics, and metrics arising from minor-free graphs, we construct {\em light} tree covers, in which every tree is a $k$-HST of low weight. Combining these covers with our results for $k$-HSTs, we obtain oblivious reliable light spanners for these metric spaces, with nearly optimal parameters. In particular, for doubling metrics we get an oblivious $ν$-reliable $(1+\varepsilon)$-spanner with lightness $\varepsilon^{-O({\rm ddim})}\cdot\tilde{O}(ν^{-2}\cdot\log n)$, which is best possible (up to lower order terms).

💡 Research Summary

The paper initiates the systematic study of light ν‑reliable spanners, i.e., spanners that remain approximately distance‑preserving after an arbitrary set of node failures while having total weight comparable to the Minimum Spanning Tree (MST). The authors first show that any deterministic ν‑reliable spanner must have lightness Ω(n) even on the simplest metric – the unweighted path – which makes deterministic constructions hopeless for achieving sub‑linear weight. Consequently, they turn to oblivious (randomized) spanners, where the guarantee on the size of the fault‑extension set B⁺ holds in expectation.

The core technical contribution is an oblivious ν‑reliable spanner for k‑HSTs (hierarchically well‑separated trees). For each tree node x they randomly sample a set Zₓ of Θ(ν⁻¹) leaves from the subtree rooted at x and connect Zₓ to the sampled sets of its children, forming a collection of bicliques. By recursively linking the query leaves to sampled representatives at their lowest common ancestor, they obtain a spanner with stretch 2 + 2/(k‑1) and lightness ≈ ν⁻²·log log n. A matching lower bound Ω(ν⁻²) on lightness holds for any finite stretch, and they prove that any stretch < 2 forces linear lightness, confirming that the HST result is essentially optimal.

To lift these results to broader metric families, the authors construct light tree covers: collections of trees where each tree is a k‑HST and the total weight of each tree is only O(k·log n) times the MST weight. By applying the HST spanner to every tree in the cover and taking the union, they obtain oblivious ν‑reliable spanners for:

• General n‑point metrics – an O(k)‑stretch spanner with lightness ˜O(ν⁻²·n^{1/k}), which matches the best possible non‑reliable lightness up to the ν⁻² factor.
• Doubling metrics (dimension ddim) – a (1 + ε)‑stretch spanner with lightness ε^{‑O(ddim)}·˜O(ν⁻²·log n). This matches the known lower bound ε^{‑Ω(ddim)} for ordinary (non‑reliable) spanners, showing the ν⁻² penalty is the only extra cost.
• Minor‑free graph metrics – a (2 + ε)‑stretch spanner with lightness ˜O(ν⁻²·polylog n). The authors also prove that any stretch below 2 would again require linear lightness.

A special focus is given to the weighted path graph Pₙ. The paper presents an oblivious ν‑reliable 1‑spanner with lightness ˜O(ν⁻²·log n) and hop‑bounded paths (≤ log n edges). A matching lower bound Ω(ν⁻²·log(νn)) is proved, establishing near‑optimality. Moreover, they show how to trade hop‑count for lightness, achieving h‑hop‑bounded spanners with lightness ≈ ν⁻²·h·n^{1/h}.

Overall, the work reveals a clear trade‑off: achieving ν‑reliability costs a factor of ν⁻² in lightness, which is unavoidable even for the simplest metrics. By combining random sampling, hierarchical tree structures, and light tree covers, the authors provide a unified framework that yields near‑optimal light ν‑reliable spanners across a wide spectrum of metric spaces, bridging the gap between fault‑tolerance and cost‑efficiency in network design.