A polynomial-time algorithm to find shortest paths with recourse.

J. Scott Provan

Published in: Networks (2003)

Keyphrases

shortest path
shortest path problem
shortest path algorithm
worst case
dynamic programming
expectation maximization
optimal path
similarity measure
finding the shortest path
path length
graph structure
path planning
special case
objective function
ant colony optimization
np hard
minimum length
social networks