Polynomial self-stabilizing algorithm and proof for a 2/3-approximation of a maximum matching.
Johanne CohenKhaled MaâmraGeorge ManoussakisLaurence PilardPublished in: CoRR (2016)
Keyphrases
- computational cost
- randomized approximation
- optimal solution
- detection algorithm
- k means
- segmentation algorithm
- maximum matching
- approximation ratio
- error bounds
- error tolerance
- computational complexity
- preprocessing
- learning algorithm
- worst case
- np hard
- search strategy
- simulated annealing
- cost function
- special case
- search space
- objective function
- similarity measure
- image segmentation