A Nearly Optimal Algorithm for Approximating Replacement Paths and k Shortest Simple Paths in General Graphs.
Aaron BernsteinPublished in: SODA (2010)
Keyphrases
- optimal path
- dynamic programming
- optimal solution
- learning algorithm
- path length
- worst case
- preprocessing
- search space
- np hard
- optimization algorithm
- adjacency graph
- computationally tractable
- locally optimal
- globally optimal
- segmentation algorithm
- expectation maximization
- k means
- shortest path
- path planning
- graph structure
- cost function
- convergence rate
- spanning tree
- particle swarm optimization
- knn
- graph construction
- lower bound