Nearly optimal approximate dual-failure replacement paths

DOI10.1137/1.9781611977912.91MaRDI QIDQ6645450zbMATH OpenFDO

Authors Shiri Chechik, Tianyi Zhang

Publication date 28 November 2024

Full work available at URL https://doi.org/10.1137/1.9781611977912.91

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(2)

• A nearly linear time construction of approximate single-source distance sensitivity oracles
• Faster algorithms for dual-failure replacement paths

This page was built for publication: Nearly optimal approximate dual-failure replacement paths

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