Roundtrip All-Pairs Shortest Paths in Directed Graphs
This work presents a comprehensive study of roundtrip APSP and distance oracles, presenting several new lower and upper bounds, and presents a combinatorial algorithm that computes a stretch-$3 approximation to all-pairs roundtrip distances.
S. Chechik, Gur Lifshitz
· 0 citations