A Nearly Optimal Algorithm for Approximating Replacement Paths and k Shortest Simple Paths in General Graphs.

Aaron Bernstein

Browse the full SODA paper archive.