1-Approximation Algorithm for Bottleneck Disjoint Path Matching.
Alak Kumar DattaRanjan K. SenPublished in: Inf. Process. Lett. (1995)
Keyphrases
- matching algorithm
- closed form
- computational cost
- learning algorithm
- times faster
- dynamic programming
- image set
- preprocessing
- search space
- significant improvement
- experimental evaluation
- similarity measure
- recognition algorithm
- optimization algorithm
- segmentation algorithm
- high accuracy
- optimal solution
- computational complexity
- np hard
- k means
- image matching
- polynomial time approximation
- approximation ratio
- error bounds
- pairwise
- path planning
- worst case
- multi objective
- detection algorithm
- mobile robot
- expectation maximization
- linear programming
- simulated annealing
- motion estimation