An efficient implementation of an algorithm for finding K shortest simple paths.
Eleni HadjiconstantinouNicos ChristofidesPublished in: Networks (1999)
Keyphrases
- detection algorithm
- learning algorithm
- improved algorithm
- computational cost
- preprocessing
- dynamic programming
- experimental evaluation
- shortest path
- optimization algorithm
- theoretical analysis
- convex hull
- cost function
- search space
- optimal solution
- linear programming
- times faster
- clustering method
- single pass
- path length
- method finds
- computational complexity
- objective function
- similarity measure
- simulated annealing
- high accuracy
- worst case
- convergence rate
- np hard
- parallel implementation
- path finding
- memory efficient