Approximate Single-Source Fault Tolerant Shortest Path

DOI10.1145/3397532OpenAlexW3039916789MaRDI QIDQ5888935FDOQ5888935

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

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

zbMATH Keywords

routingsubgraphfault-tolerantoracleapproximate-distances

Mathematics Subject Classification ID

Other classical first-order model theory (03C68)

Cited In (7)

• Shortest path problems with node failures
• Title not available (Why is that?)
• Multiple-edge-fault-tolerant approximate shortest-path trees
• Fault-tolerant distance labeling for planar graphs
• Fault-tolerant distance labeling for planar graphs
• Single backup table schemes for shortest-path routing
• Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs

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)