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]

@article{Salavatipour04:0,
  title = {A (1 + varepsilon )-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lova sz Local Lemma},
  author = {Mohammad R. Salavatipour},
  year = {2004},
  doi = {10.1002/rsa.20016},
  url = {http://dx.doi.org/10.1002/rsa.20016},
  tags = {partitioning},
  researchr = {https://researchr.org/publication/Salavatipour04%3A0},
  cites = {0},
  citedby = {0},
  journal = {Random Struct. Algorithms},
  volume = {25},
  number = {1},
  pages = {68-90},
}