On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem.
Pavlos EirinakisMatthew D. WilliamsonK. SubramaniPublished in: J. Graph Algorithms Appl. (2017)
Keyphrases
- shortest path problem
- learning algorithm
- shortest path
- preprocessing
- experimental evaluation
- optimization algorithm
- times faster
- np hard
- high accuracy
- worst case
- computational cost
- dynamic programming
- recognition algorithm
- search space
- pairwise
- single source
- bicriteria
- similarity measure
- matching algorithm
- tree structure
- clustering method
- theoretical analysis
- cost function
- significant improvement
- k means
- expectation maximization
- linear programming
- simulated annealing
- probability distribution
- probabilistic model
- computational complexity
- optimal solution
- reinforcement learning
- interval data