A (1+epsilon)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovsz Local Lemma.

Mohammad R. Salavatipour

Browse the full SODA paper archive.