An O(N log N) Algorithm for a Class of Matching Problems.
Nimrod MegiddoArie TamirPublished in: SIAM J. Comput. (1978)
Keyphrases
- matching algorithm
- optimization algorithm
- high accuracy
- worst case
- np hard
- k means
- computational complexity
- benchmark problems
- segmentation algorithm
- cost function
- np complete
- image matching
- combinatorial optimization
- particle swarm optimization
- linear programming
- matching process
- learning algorithm
- dynamic programming
- significant improvement
- evolutionary algorithm
- preprocessing
- objective function
- simulated annealing
- scheduling problem
- computational cost
- experimental evaluation
- detection algorithm
- optimal solution
- genetic algorithm
- test problems
- multi class classification
- iterative algorithms
- theoretical guarantees