FB-APSP: A new efficient algorithm for computing all-pairs shortest-paths.
Dyson Pereira JuniorEmílio Carlos Gomes WillePublished in: J. Netw. Comput. Appl. (2018)
Keyphrases
- single pass
- dynamic programming
- optimization algorithm
- preprocessing
- worst case
- k means
- np hard
- selection algorithm
- expectation maximization
- optimal solution
- cost function
- matching algorithm
- clustering method
- improved algorithm
- theoretical analysis
- convex hull
- convergence rate
- times faster
- path planning
- experimental study
- input data
- hardware implementation
- maximum likelihood
- linear programming
- high efficiency
- computational cost
- objective function
- memory efficient
- estimation algorithm
- learning algorithm
- detection algorithm
- computationally efficient
- simulated annealing
- high accuracy
- significant improvement
- feature space