A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application.
Tadao TakaokaPublished in: COCOON (2004)
Keyphrases
- shortest path problem
- experimental evaluation
- single source
- preprocessing
- detection algorithm
- shortest path
- dynamic programming
- computational cost
- probabilistic model
- objective function
- linear programming
- worst case
- search space
- k means
- interval data
- memory efficient
- computational complexity
- times faster
- genetic programming
- significant improvement
- simulated annealing
- scheduling problem
- high accuracy
- probability distribution
- computationally demanding
- learning algorithm
- np hard
- combinatorial optimization problems
- data clustering
- combinatorial optimization
- matching algorithm
- clustering method
- optimization algorithm
- segmentation algorithm
- unsupervised learning