Matthew Maxel

Learn More
We describe a new algorithm to enumerate the <i>k</i> shortest simple (loopless) paths in a directed graph and report on its implementation. Our algorithm is based on a <i>replacement paths</i> algorithm proposed by Hershberger and Suri [2001], and can yield a factor &Theta;(<i>n</i>) improvement for this problem. But there is a caveat: The fast replacement(More)
  • 1