A factor 1/2 approximation algorithm for two-stage stochastic matching problems.
Nan KongAndrew J. SchaeferPublished in: Eur. J. Oper. Res. (2006)
Keyphrases
- matching algorithm
- benchmark problems
- learning algorithm
- optimal solution
- cost function
- dynamic programming
- objective function
- error bounds
- expectation maximization
- computational cost
- preprocessing
- knapsack problem
- np hard
- recognition algorithm
- np complete
- theoretical analysis
- detection algorithm
- approximation ratio
- image set
- convex hull
- test problems
- polynomial time approximation
- combinatorial optimization
- image matching
- optimization problems
- worst case
- significant improvement
- computational complexity
- similarity measure