Computing almost shortest paths

Michael Elkin. Computing almost shortest paths. ACM Transactions on Algorithms, 1(2):283-323, 2005. [doi]

Abstract

Abstract is missing.