Approximate Distance Sensitivity Oracles in Subquadratic Space

05/19/2023
by   Davide Bilò, et al.
0

An f-edge fault-tolerant distance sensitive oracle (f-DSO) with stretch σ≥ 1 is a data structure that preprocesses a given undirected, unweighted graph G with n vertices and m edges, and a positive integer f. When queried with a pair of vertices s, t and a set F of at most f edges, it returns a σ-approximation of the s-t-distance in G-F. We study f-DSOs that take subquadratic space. Thorup and Zwick [JACM 2015] showed that this is only possible for σ≥ 3. We present, for any constant f ≥ 1 and α∈ (0, 1/2), and any ε > 0, an f-DSO with stretch 3 + ε that takes O(n^2-α/f+1/ε) · O(log n/ε)^f+1 space and has an O(n^α/ε^2) query time. We also give an improved construction for graphs with diameter at most D. For any constant k, we devise an f-DSO with stretch 2k-1 that takes O(D^f+o(1) n^1+1/k) space and has O(D^o(1)) query time, with a preprocessing time of O(D^f+o(1) mn^1/k). Chechik, Cohen, Fiat, and Kaplan [SODA 2017] presented an f-DSO with stretch 1+ε and preprocessing time O_ε(n^5+o(1)), albeit with a super-quadratic space requirement. We show how to reduce their preprocessing time to O_ε(mn^2+o(1)).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/05/2023

Fault-Tolerant ST-Diameter Oracles

We study the problem of estimating the ST-diameter of a graph that is su...
research
04/27/2023

Compact Distance Oracles with Large Sensitivity and Low Stretch

An f-edge fault-tolerant distance sensitive oracle (f-DSO) with stretch ...
research
11/06/2020

Fault-Tolerant All-Pairs Mincuts

Let G=(V,E) be an undirected unweighted graph on n vertices and m edges....
research
07/07/2021

Space-Efficient Fault-Tolerant Diameter Oracles

We design f-edge fault-tolerant diameter oracles (f-FDOs). We preprocess...
research
11/05/2021

Maintaining Exact Distances under Multiple Edge Failures

We present the first compact distance oracle that tolerates multiple fai...
research
03/06/2023

The Complexity of Geodesic Spanners

A geometric t-spanner for a set S of n point sites is an edge-weighted g...
research
07/18/2019

Sensitive Distance and Reachability Oracles for Large Batch Updates

In the sensitive distance oracle problem, there are three phases. We fir...

Please sign up or login with your details

Forgot password? Click here to reset