Finding Short Paths on Polytopes by the Shadow Vertex Algorithm
Tobias BrunschHeiko RöglinPublished in: CoRR (2013)
Keyphrases
- dynamic programming
- preprocessing
- detection algorithm
- times faster
- objective function
- computational complexity
- k means
- np hard
- improved algorithm
- experimental evaluation
- learning algorithm
- cost function
- computational cost
- probabilistic model
- similarity measure
- matching algorithm
- segmentation algorithm
- minimum length
- optimal path
- path finding
- convex hull
- optimization algorithm
- computationally efficient
- graph cuts
- high accuracy
- worst case
- significant improvement
- search space
- decision trees