Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances

@inproceedings{Bil2022DeterministicSO,
title={Deterministic Sensitivity Oracles for Diameter, Eccentricities and All Pairs Distances},
author={Davide Bil{\o} and Keerti Choudhary and Sarel Cohen and Tobias Friedrich and Martin Schirneck},
booktitle={ICALP},
year={2022}
}`
• Published in ICALP 22 April 2022
• Computer Science
We construct data structures for extremal and pairwise distances in directed graphs in the presence of transient edge failures. Henzinger et al. [ITCS 2017] initiated the study of fault-tolerant (sensitivity) oracles for the diameter and vertex eccentricities. We extend this with a special focus on space eﬃciency. We present several new data structures, among them the ﬁrst fault-tolerant eccentricity oracle for dual failures in subcubic space. We further prove lower bounds that show limits to…

References

SHOWING 1-10 OF 36 REFERENCES
Maintaining exact distances under multiple edge failures
• Mathematics, Computer Science
STOC
• 2022
The first compact distance oracle that tolerates multiple failures and maintains *exact* distances is presented, which seems to require nΩ(d) time to preprocess; it is left as an open question to improve this preprocessing time.
Improved Distance Sensitivity Oracles via Fast Single-Source Replacement Paths
• Computer Science
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
• 2012
This paper presents the first distance sensitivity oracle that achieves simultaneously subcubic preprocessing time and sublinear query time for integer weights in the interval [-M, M], and matches the best known runtime for the simpler replacement paths problem in which both the source s and the target t are fixed.
Constructing a Distance Sensitivity Oracle in O(n2.5794M) Time
• Computer Science
ICALP
• 2021
The main technical ingredient is an algorithm that computes the inverse of a degree-d polynomial matrix modulo x, which improves the O(n2.6865M) time bound in [Ren, ESA 2020], and matches the current best time bound for computing all-pairs shortest paths.
Distance sensitivity oracles with subcubic preprocessing time and fast query time
• Computer Science
STOC
• 2020
This paper affirmatively presents the first distance sensitivity oracle with subcubic preprocessing time and poly-logarithmic query time for directed graphs with integer weights in the range [−M,M] and presents a distance sensitive oracle supporting a single vertex/edge failure in subcUBic Õ(Mn 2.873) query time.
A nearly optimal oracle for avoiding failed vertices and edges
• Computer Science, Mathematics
STOC '09
• 2009
An improved oracle for the distance sensitivity problem that has an improved construction time of ~O(mn), and it is deterministic, barring improved solutions to the all pairs shortest path problem, is optimal up to logarithmic factors.
Conditional Hardness for Sensitivity Problems
• Computer Science, Mathematics
ITCS
• 2017
In recent years it has become popular to study dynamic problems in a sensitivity setting: Instead of allowing for an arbitrary sequence of updates, the sensitivity model only allows to apply batch
Improved Distance Sensitivity Oracles via Tree Partitioning
• Computer Science
• 2017
We introduce an improved structure of distance sensitivity oracle (DSO). The task is to pre-process a non-negatively weighted graph so that a data structure can quickly answer replacement path length
Improved Distance Sensitivity Oracles with Subcubic Preprocessing Time
This work considers the problem of building Distance Sensitivity Oracles (DSOs), and constructs a DSO with preprocessing time $P+\tilde{O}(n^2)\cdot Q$ and query time $O(1)$.
Oracles for Distances Avoiding a Failed Node or Link
• Computer Science
SIAM J. Comput.
• 2008
A deterministic oracle with constant query time for this problem that uses $O (n^2\log n)$ space, where $n$ is the number of vertices in $G$ and the construction time for the oracle is $O(mn^{2} + n^{3}\ log n)$.
Faster Replacement Paths and Distance Sensitivity Oracles
• Computer Science
ACM Trans. Algorithms
• 2020
The result shows that, at least for small integer weights, the replacement paths problem in directed graphs may be easier than the related all-pairs shortest paths problem, as the current best runtime for the latter is õ(M1\4−ω n2+1 \ 4−ω): this is Ω (n2.5) even if ω = 2.5, hence matching the mentioned result for the simpler replacement paths case.