A self-stabilizing 2/3-approximation algorithm for the maximum matching problem.
Fredrik ManneMorten MjeldeLaurence PilardSébastien TixeuilPublished in: Theor. Comput. Sci. (2011)
Keyphrases
- maximum matching
- theoretical analysis
- learning algorithm
- preprocessing
- randomly generated
- matching algorithm
- np hard
- dynamic programming
- similarity measure
- approximation ratio
- closed form
- objective function
- optimal solution
- cost function
- computational cost
- orders of magnitude
- lower complexity
- search space
- search strategy
- combinatorial optimization
- k means
- special case
- detection algorithm
- optimization algorithm
- segmentation algorithm
- linear programming
- simulated annealing
- worst case
- probabilistic model