Similar Items: Simpler and Improved Replacement Path Coverings
- Undirected Replacement Paths: Dual Fault Reduces to Single Source
- Designing Capacitated Subnetworks for Shortest Path Routing
- Separating Feasibility and Movement in Solution Discovery: The Case of Path Discovery
- Label Correcting Algorithms for the Multiobjective Temporal Shortest Path Problem
- Polylogarithmic Approximation for Covering and Connecting Multi-Interface Networks
- Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial