A Sidetrack-Based Algorithm for Finding the k Shortest Simple Paths in a Directed Graph.
Denis KurzPetra MutzelPublished in: CoRR (2016)
Keyphrases
- directed graph
- shortest path problem
- cost function
- shortest path
- preprocessing
- k means
- dynamic programming
- matching algorithm
- maximum flow
- np hard
- learning algorithm
- optimization algorithm
- worst case
- path length
- graph structure
- computational complexity
- detection algorithm
- computational cost
- search space
- combinatorial optimization
- objective function