Similar Items: Undirected Replacement Paths: Dual Fault Reduces to Single Source
- Simpler and Improved Replacement Path Coverings
- Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs
- Designing Capacitated Subnetworks for Shortest Path Routing
- Block Permutation Routing on Ramanujan Hypergraphs for Fault-Tolerant Quantum Computing
- Separating Feasibility and Movement in Solution Discovery: The Case of Path Discovery
- Label Correcting Algorithms for the Multiobjective Temporal Shortest Path Problem