Approximate distance sensitivity oracles in subquadratic space
type: Item
instance of: scholarly article
title: Approximate distance sensitivity oracles in subquadratic space
author: D. Bilò
author: Shiri Chechik
author: Keerti Choudhary
author: Sarel Cohen
author: Tobias Friedrich
author: Simon Krogmann
author: Martin Schirneck
published in: TheoretiCS
publication date: 2024-07-03T00:00:00Z
Mathematics Subject Classification ID: 68-XX
zbMATH DE Number: 7875519
zbMATH Keywords: data structures
zbMATH Keywords: distance sensitivity oracles
zbMATH Keywords: fault tolerance
zbMATH Keywords: shortest paths
zbMATH Keywords: subquadratic space
MaRDI profile type: MaRDI publication profile
cites work: On Approximate Distance Labels and Routing Schemes with Affine Stretch
cites work: Restoration by path concatenation: fast recovery of MPLS paths
cites work: The Space-Stretch-Time Tradeoff in Distance Oracles
cites work: Distance Oracles for Stretch Less Than 2
cites work: Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles
cites work: Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs
cites work: Q4508365
cites work: A nearly optimal oracle for avoiding failed vertices and edges
cites work: Q3579391
cites work: Approximate distance sensitivity oracles in subquadratic space
cites work: Compact distance oracles with large sensitivity and low stretch
cites work: Deterministic sensitivity oracles for diameter, eccentricities and all pairs distances
cites work: Q6075905
cites work: Q6168428
cites work: Q6147432
cites work: Partially optimal edge fault-tolerant spanners
cites work: Multiple-source shortest paths in embedded graphs
cites work: Distance sensitivity oracles with subcubic preprocessing time and fast query time
cites work: (1 + ∊)-Approximate f-Sensitive Distance Oracles
cites work: \(f\)-sensitivity distance oracles and routing schemes
cites work: Fault Tolerant Spanners for General Graphs
cites work: Q5871911
cites work: Q4829020
cites work: Oracles for Distances Avoiding a Failed Node or Link
cites work: Q4633861
cites work: Maintaining exact distances under multiple edge failures
cites work: Q5543308
cites work: Faster Replacement Paths and Distance Sensitivity Oracles
cites work: Deterministic dictionaries
cites work: Q6147293
cites work: Q4542536
cites work: Distance Oracles beyond the Thorup--Zwick Bound
cites work: Improved distance sensitivity oracles with subcubic preprocessing time
cites work: Replacement paths and k simple shortest paths in unweighted directed graphs
cites work: Approximate distance oracles
cites work: Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication
DOI: 10.46298/THEORETICS.24.15
description: scientific article; zbMATH DE number 7875519