A simplified algorithm for the all pairs shortest path problem with O(n 2logn) expected time.
Tadao TakaokaPublished in: J. Comb. Optim. (2013)
Keyphrases
- shortest path problem
- shortest path
- single source
- detection algorithm
- learning algorithm
- cost function
- experimental evaluation
- computational cost
- interval data
- bicriteria
- benchmark problems
- directed graph
- times faster
- optimization algorithm
- np hard
- search space
- preprocessing
- optimal solution
- similarity measure
- probabilistic model
- high accuracy
- segmentation algorithm
- k means
- matching algorithm
- computational complexity
- objective function
- bayesian networks
- neural network