Covering Approximate Shortest Paths with DAGs
Open Access
- 15 June 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 2269-2280
Abstract
No abstract availableAll Related Versions
Funding Information
- NSERC (RGPIN-2024-04290)
- NSF (National Science Foundation) (NSF:AF 2153680)
This publication has 50 references indexed in Scilit:
- Irreducible nonmetrizable path systems in graphsJournal of Graph Theory, 2022
- Geodesic Geometry on GraphsDiscrete & Computational Geometry, 2022
- Graph spanners: A tutorial reviewComputer Science Review, 2020
- Thorup–Zwick emulators are universally optimal hopsetsInformation Processing Letters, 2019
- Near-Optimal Distributed Tree Embedding2014
- Optimal cuts and partitions in tree metrics in polynomial timeInformation Processing Letters, 2013
- DAG-Width and Parity GamesLecture Notes in Computer Science, 2006
- Finding next-to-shortest paths in a graphInformation Processing Letters, 2004
- A tight bound on approximating arbitrary metrics by tree metricsJournal of Computer and System Sciences, 2004
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree ProblemJournal of Algorithms, 2000