Improved Distance (Sensitivity) Oracles with Subquadratic Space

TL;DR

This work addresses the design of subquadratic-space distance oracles (DOs) that achieve near-additive or near-multiplicative guarantees for general graphs, and extends them to fault-tolerant settings via distance sensitivity oracles (f-DSOs). The authors introduce a subquadratic-space DO that tolerates a small additive stretch while driving the multiplicative factor toward 1, circumventing known lower bounds for purely multiplicative schemes. They then develop a black-box framework that converts an (α,β)-stretch DO into an (α(1+ε),β)-stretch f-DSO with subquadratic space for f = o(log n / log log n), using novel constructs such as pivot trees and fault-tolerant trees. By combining these components, they obtain a deterministic f-DSO that, for appropriate parameters, achieves a stretch of ((1+1/ℓ)(1+ε), 2) with space n^{2 - γ/((ℓ+1)(f+1)) + o(1)}/ε^{f+2} and sublinear query time. The results substantially advance subquadratic, fault-tolerant distance estimation in general graphs, with potential impact on robust routing and network design under failures.

Abstract

A distance oracle (DO) with stretch $(α, β)$ for a graph $G$ is a data structure that, when queried with vertices $s$ and $t$, returns a value $\widehat{d}(s,t)$ such that $d(s,t) \le \widehat{d}(s,t) \le α\cdot d(s,t) + β$. An $f$-edge fault-tolerant distance sensitivity oracle ($f$-DSO) additionally receives a set $F$ of up to $f$ edges and estimates the $s$-$t$-distance in $G{-}F$. Our first contribution is a new distance oracle with subquadratic space for undirected graphs. Introducing a small additive stretch $β> 0$ allows us to make the multiplicative stretch $α$ arbitrarily small. This sidesteps a known lower bound of $α\ge 3$ (for $β= 0$ and subquadratic space) [Thorup & Zwick, JACM 2005]. We present a DO for graphs with edge weights in $[0,W]$ that, for any positive integer $t$ and any $c \in (0, \ell/2]$, has stretch $(1{+}\frac{1}{\ell}, 2W)$, space $\widetilde{O}(n^{2-\frac{c}{t}})$, and query time $O(n^c)$. These are the first subquadratic-space DOs with $(1+ε, O(1))$-stretch generalizing Agarwal and Godfrey's results for sparse graphs [SODA 2013] to general undirected graphs. Our second contribution is a framework that turns a $(α,β)$-stretch DO for unweighted graphs into an $(α(1{+}\varepsilon),β)$-stretch $f$-DSO with sensitivity $f = o(\log(n)/\log\log n)$ and retains subquadratic space. This generalizes a result by Bilò, Chechik, Choudhary, Cohen, Friedrich, Krogmann, and Schirneck [STOC 2023, TheoretiCS 2024] for the special case of stretch $(3,0)$ and $f = O(1)$. By combining the framework with our new distance oracle, we obtain an $f$-DSO that, for any $γ\in (0, (\ell{+}1)/2]$, has stretch $((1{+}\frac{1}{\ell}) (1{+}\varepsilon), 2)$, space $n^{ 2- \fracγ{(\ell+1)(f+1)} + o(1)}/\varepsilon^{f+2}$, and query time $\widetilde{O}(n^γ /{\varepsilon}^2)$.

Figures (1)

• Figure :

Theorems & Definitions (46)

• Theorem 1
• Corollary 2
• Theorem 3
• Corollary 4
• Theorem 5
• Theorem 6
• Theorem 7
• Theorem 7
• Lemma 8
• proof