Improved distance sensitivity oracles via fast single-source replacement paths

DOI10.1109/FOCS.2012.17MaRDI QIDQ6988168zbMATH OpenFDO

Authors Virginia Vassilevska Williams, Fabrizio Grandoni

Publication date 5 May 2025

Full work available at URL https://doi.org/10.1109/FOCS.2012.17

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cited in

(7)

• Near optimal algorithm for the directed single source replacement paths problem
• Faster algorithms for dual-failure replacement paths
• Near optimal algorithm for fault tolerant distance oracle and single source replacement path problem
• Fault tolerant max-cut
• A nearly linear time construction of approximate single-source distance sensitivity oracles
• Fault-tolerant labeling and compact routing schemes
• Undirected 3-fault replacement path in nearly cubic time

This page was built for publication: Improved distance sensitivity oracles via fast single-source replacement paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988168)