Inapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion Hypothesis

Pasin Manurangsi. Inapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion Hypothesis. In Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, Anca Muscholl, editors, 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland. Volume 80 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. [doi]

@inproceedings{Manurangsi17-0,
  title = {Inapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion Hypothesis},
  author = {Pasin Manurangsi},
  year = {2017},
  doi = {10.4230/LIPIcs.ICALP.2017.79},
  url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.79},
  researchr = {https://researchr.org/publication/Manurangsi17-0},
  cites = {0},
  citedby = {0},
  booktitle = {44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland},
  editor = {Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl},
  volume = {80},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-95977-041-5},
}