A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem.
Bang Ye WuPublished in: COCOA (2) (2010)
Keyphrases
- shortest path problem
- single pass
- times faster
- computationally efficient
- cost function
- detection algorithm
- computational complexity
- dynamic programming
- learning algorithm
- k means
- experimental evaluation
- single source
- high accuracy
- preprocessing
- optimization algorithm
- interval data
- pruning strategy
- high efficiency
- directed graph
- optimal solution
- expectation maximization
- computational cost
- search algorithm
- data clustering
- highly efficient
- simulated annealing
- worst case
- np hard
- search space