Removing Sequential Bottleneck of Dijkstra's Algorithm for the Shortest Path Problem.
Vijay K. GargPublished in: CoRR (2018)
Keyphrases
- shortest path problem
- shortest path
- cost function
- single source
- times faster
- high accuracy
- optimization algorithm
- computational cost
- experimental evaluation
- ant colony optimization
- preprocessing
- computational complexity
- objective function
- tree structure
- recognition algorithm
- learning algorithm
- worst case
- significant improvement
- k means
- search space
- image segmentation
- simulated annealing
- linear programming
- segmentation algorithm
- neural network
- probabilistic model
- dynamic programming
- directed graph
- multiple objectives
- decision trees
- bicriteria