A Self-stabilizing -Approximation Algorithm for the Maximum Matching Problem.
Fredrik ManneMorten MjeldeLaurence PilardSébastien TixeuilPublished in: SSS (2008)
Keyphrases
- maximum matching
- computational complexity
- computational cost
- learning algorithm
- recognition algorithm
- error bounds
- matching algorithm
- detection algorithm
- worst case
- dynamic programming
- np hard
- k means
- search space
- optimal solution
- objective function
- scheduling problem
- bipartite graph
- cost function
- evolutionary algorithm
- expectation maximization
- np complete
- theoretical analysis
- optimization algorithm
- preprocessing
- combinatorial optimization
- genetic algorithm