Mean-field approximation, convex hierarchies, and the optimality of correlation rounding: a unified perspective

Vishesh Jain, Frederic Koehler, Andrej Risteski. Mean-field approximation, convex hierarchies, and the optimality of correlation rounding: a unified perspective. In Moses Charikar, Edith Cohen, editors, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019. pages 1226-1236, ACM, 2019. [doi]

@inproceedings{JainKR19,
  title = {Mean-field approximation, convex hierarchies, and the optimality of correlation rounding: a unified perspective},
  author = {Vishesh Jain and Frederic Koehler and Andrej Risteski},
  year = {2019},
  doi = {10.1145/3313276.3316299},
  url = {https://doi.org/10.1145/3313276.3316299},
  researchr = {https://researchr.org/publication/JainKR19},
  cites = {0},
  citedby = {0},
  pages = {1226-1236},
  booktitle = {Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019},
  editor = {Moses Charikar and Edith Cohen},
  publisher = {ACM},
  isbn = {978-1-4503-6705-9},
}