A nonenumerative algorithm to find the k longest (shortest) paths in a DAG

Published in: CoRR (2013)

Keyphrases

shortest path
shortest path problem
finding the shortest path
shortest path algorithm
objective function
geodesic distance
dynamic programming
np hard
expectation maximization
minimum cost flow
distance function
optimal path
goal state
high dimensional
distance transformation
dijkstra algorithm
optimal solution