Efficient Oracles and Routing Schemes for Replacement Paths
From MaRDI portal
Publication:3304107
DOI10.4230/LIPIcs.STACS.2018.13zbMath1487.68051OpenAlexW2794115812MaRDI QIDQ3304107
Luciano Gualà, Stefano Leucci, Keerti Choudhary, Davide Bilò, Guido Proietti, Merav Parter
Publication date: 5 August 2020
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/8524/pdf/LIPIcs-STACS-2018-13.pdf/
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (3)
Unnamed Item ⋮ Deterministic Fault-Tolerant Connectivity Labeling Scheme ⋮ Multiple-edge-fault-tolerant approximate shortest-path trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The level ancestor problem simplified
- \(f\)-sensitivity distance oracles and routing schemes
- On Lipschitz embedding of finite metric spaces in Hilbert space
- The k most vital arcs in the shortest path problem
- Vertex fault tolerant additive spanners
- On the distortion required for embedding finite metric spaces into normed spaces
- Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs
- Fault-tolerant compact routing schemes for general graphs
- Sparse Fault-Tolerant BFS Trees
- Fault-Tolerant Approximate Shortest-Path Trees
- New Pairwise Spanners
- Improved Purely Additive Fault-Tolerant Spanners
- Oracles for Distances Avoiding a Failed Node or Link
- Compact Forbidden-Set Routing
- (1 + ∊)-Approximate f-Sensitive Distance Oracles
- Multiple-edge-fault-tolerant approximate shortest-path trees
- Compact and Fast Sensitivity Oracles for Single-Source Distances
- Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension
- Distance Oracles for Sparse Graphs
- A nearly optimal oracle for avoiding failed vertices and edges
- The 4/3 additive spanner exponent is tight
- Fault Tolerant Approximate BFS Structures
This page was built for publication: Efficient Oracles and Routing Schemes for Replacement Paths
