New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting

Archontia C. Giannopoulou, Sudeshna Kolay, Saket Saurabh. New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting. In David Fernández-Baca, editor, LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings. Volume 7256 of Lecture Notes in Computer Science, pages 408-419, Springer, 2012. [doi]

@inproceedings{GiannopoulouKS12,
  title = {New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting},
  author = {Archontia C. Giannopoulou and Sudeshna Kolay and Saket Saurabh},
  year = {2012},
  doi = {10.1007/978-3-642-29344-3_35},
  url = {http://dx.doi.org/10.1007/978-3-642-29344-3_35},
  researchr = {https://researchr.org/publication/GiannopoulouKS12},
  cites = {0},
  citedby = {0},
  pages = {408-419},
  booktitle = {LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings},
  editor = {David Fernández-Baca},
  volume = {7256},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-29343-6},
}