An Approximation Algorithm for Maximum Packing of 3-Edge Paths.
Refael HassinShlomi RubinsteinPublished in: Inf. Process. Lett. (1997)
Keyphrases
- dynamic programming
- learning algorithm
- worst case
- closed form
- computational complexity
- experimental evaluation
- search space
- times faster
- convergence rate
- matching algorithm
- computational cost
- detection algorithm
- error bounds
- multiscale
- optimization algorithm
- recognition algorithm
- high accuracy
- mobile robot
- significant improvement
- path length
- integer programming
- optimal path
- edge detection algorithms
- polygonal approximation
- edge detector
- gradient information
- greedy algorithm
- convex hull
- path planning
- segmentation algorithm
- theoretical analysis
- particle swarm optimization
- k means
- search algorithm
- optimal solution
- similarity measure