Near linear time (1 + ε)-approximation for restricted shortest paths in undirected graphs.

Aaron Bernstein

Browse the full SODA paper archive.