A (1 + varepsilon )-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lova sz Local Lemma

Mohammad R. Salavatipour. A (1 + varepsilon )-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lova sz Local Lemma. Random Struct. Algorithms, 25(1):68-90, 2004. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.