An improved approximation algorithm for the 0-extension problem.
Jittat FakcharoenpholChris HarrelsonSatish RaoKunal TalwarPublished in: SODA (2003)
Keyphrases
- computational complexity
- dynamic programming
- improved algorithm
- experimental evaluation
- detection algorithm
- optimization algorithm
- expectation maximization
- significant improvement
- high accuracy
- worst case
- computational cost
- times faster
- segmentation algorithm
- theoretical analysis
- probabilistic model
- np hard
- lower bound
- neural network
- closed form
- selection algorithm
- optimal solution
- objective function
- state space
- convex hull
- path planning
- classification algorithm
- computationally efficient
- mobile robot
- search space
- preprocessing
- feature selection