Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances.
David P. WilliamsonMichel X. GoemansPublished in: INFORMS J. Comput. (1996)
Keyphrases
- matching algorithm
- dynamic programming
- randomly generated
- computational complexity
- matching process
- error bounds
- detection algorithm
- expectation maximization
- objective function
- cost function
- combinatorial optimization
- optimization algorithm
- learning algorithm
- error tolerance
- string matching
- np complete
- optimal solution
- preprocessing
- computational cost
- np hard
- genetic algorithm
- cutting plane
- similarity measure
- recognition algorithm
- knapsack problem
- significant improvement
- closed form
- ant colony optimization
- distance function
- image registration
- simulated annealing
- segmentation algorithm
- theoretical analysis