A (1+epsilon)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász Local Lemma.
Mohammad R. SalavatipourPublished in: SODA (2003)
Keyphrases
- detection algorithm
- np hard
- learning algorithm
- dynamic programming
- preprocessing
- improved algorithm
- cost function
- significant improvement
- convex hull
- search space
- original version
- linear programming
- graph partitioning
- approximation ratio
- times faster
- closed form
- optimization algorithm
- neural network
- experimental evaluation
- objective function
- segmentation algorithm
- probabilistic model
- computational cost
- error bounds
- graph theory
- pairwise
- computational complexity
- polynomial time approximation
- image segmentation
- disjoint subsets
- johnson lindenstrauss