Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs

Venkatesan Guruswami, Euiwoong Lee. Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs. In Piotr Indyk, editor, Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015. pages 822-836, SIAM, 2015. [doi]

@inproceedings{GuruswamiL15,
  title = {Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs},
  author = {Venkatesan Guruswami and Euiwoong Lee},
  year = {2015},
  doi = {10.1137/1.9781611973730.56},
  url = {http://dx.doi.org/10.1137/1.9781611973730.56},
  researchr = {https://researchr.org/publication/GuruswamiL15},
  cites = {0},
  citedby = {0},
  pages = {822-836},
  booktitle = {Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015},
  editor = {Piotr Indyk},
  publisher = {SIAM},
  isbn = {978-1-61197-373-0},
}