: An Efficient Algorithm for the One-to-Some Shortest Path Problem on Road Maps.
Dan HePublished in: AAIM (2007)
Keyphrases
- shortest path problem
- detection algorithm
- dynamic programming
- segmentation algorithm
- shortest path
- experimental evaluation
- cost function
- learning algorithm
- single source
- computationally efficient
- search space
- k means
- optimization algorithm
- preprocessing
- computational complexity
- worst case
- high accuracy
- matching algorithm
- benchmark problems
- neural network
- significant improvement
- optimal solution