A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem.
Fredrik ManneRob H. BisselingPublished in: PPAM (2007)
Keyphrases
- detection algorithm
- maximum matching
- objective function
- learning algorithm
- dynamic programming
- search space
- np hard
- cost function
- k means
- segmentation algorithm
- matching algorithm
- parallel implementation
- preprocessing
- upper bound
- worst case
- expectation maximization
- computational complexity
- closed form
- weighted graph
- randomly generated
- polygonal approximation
- approximation ratio
- polynomial time approximation