A Sidetrack-Based Algorithm for Finding the k Shortest Simple Paths in a Directed Graph.
Denis KurzPetra MutzelPublished in: ISAAC (2016)
Keyphrases
- directed graph
- computational complexity
- learning algorithm
- graph structure
- worst case
- dynamic programming
- shortest path problem
- preprocessing
- optimization algorithm
- maximum flow
- cost function
- path length
- computational cost
- path finding
- strongly connected
- detection algorithm
- optimal path
- objective function
- shortest path
- simulated annealing
- k means
- search space
- social network analysis
- matching algorithm
- knapsack problem
- random walk
- particle swarm optimization
- state space
- np hard