Subexponential LPs Approximate Max-Cut

Samuel B. Hopkins, Tselil Schramm, Luca Trevisan. Subexponential LPs Approximate Max-Cut. In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020. pages 943-953, IEEE, 2020. [doi]

@inproceedings{HopkinsST20,
  title = {Subexponential LPs Approximate Max-Cut},
  author = {Samuel B. Hopkins and Tselil Schramm and Luca Trevisan},
  year = {2020},
  doi = {10.1109/FOCS46700.2020.00092},
  url = {https://doi.org/10.1109/FOCS46700.2020.00092},
  researchr = {https://researchr.org/publication/HopkinsST20},
  cites = {0},
  citedby = {0},
  pages = {943-953},
  booktitle = {61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020},
  publisher = {IEEE},
  isbn = {978-1-7281-9621-3},
}