A (1 + varepsilon )-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lova'sz Local Lemma.
Mohammad R. SalavatipourPublished in: Random Struct. Algorithms (2004)
Keyphrases
- learning algorithm
- high accuracy
- experimental evaluation
- improved algorithm
- preprocessing
- computational complexity
- search space
- times faster
- optimal solution
- detection algorithm
- k means
- np hard
- dynamic programming
- optimization algorithm
- significant improvement
- cost function
- genetic algorithm
- computational cost
- closed form
- probabilistic model
- convex hull
- error bounds
- image segmentation
- polynomial time approximation
- original version
- ant colony optimization
- segmentation algorithm
- input data
- similarity measure
- bayesian networks
- data structure
- objective function