Approximate Single-Source Fault Tolerant Shortest Path

DOI10.1145/3397532MaRDI QIDQ5888935zbMATH OpenOpenAlexFDO

Authors Surender Baswana, Keerti Choudhary, Moazzam Hussain, Liam Roditty

Publication date 26 April 2023

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3397532

zbMATH Keywords

approximate-distancesfault-tolerantoracleroutingsubgraph

Mathematics Subject Classification ID

Other classical first-order model theory (03C68)

Recommendations

• scientific article; zbMATH DE number 6850433
• Path-fault-tolerant approximate shortest-path trees
• Multiple-edge-fault-tolerant approximate shortest-path trees
• Fault-tolerant approximate shortest-path trees
• Fault-tolerant approximate shortest-path trees

Cited in

(11)

• Single backup table schemes for shortest-path routing
• Shortest path problems with node failures
• Multiple-edge-fault-tolerant approximate shortest-path trees
• scientific article; zbMATH DE number 6850433 (Why is no real title available?)
• Fault-tolerant distance labeling for planar graphs
• Fault-tolerant distance labeling for planar graphs
• Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs
• A nearly linear time construction of approximate single-source distance sensitivity oracles
• Optimal sensitivity oracle for Steiner mincut
• Fault-tolerant ST-diameter oracles
• Minimum+1 Steiner cut and dual edge sensitivity oracle: bridging gap between global and (s,t)-cut

This page was built for publication: Approximate Single-Source Fault Tolerant Shortest Path

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