The MAX-CUT of sparse random graphs

Hervé Daudé, Conrado Martínez, Vonjy Rasendrahasina, Vlady Ravelomanana. The MAX-CUT of sparse random graphs. In Yuval Rabani, editor, Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012. pages 265-271, SIAM, 2012. [doi]

@inproceedings{DaudeMRR12,
  title = {The MAX-CUT of sparse random graphs},
  author = {Hervé Daudé and Conrado Martínez and Vonjy Rasendrahasina and Vlady Ravelomanana},
  year = {2012},
  url = {http://portal.acm.org/citation.cfm?id=2095140&CFID=63838676&CFTOKEN=79617016},
  researchr = {https://researchr.org/publication/DaudeMRR12},
  cites = {0},
  citedby = {0},
  pages = {265-271},
  booktitle = {Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, January 17-19, 2012},
  editor = {Yuval Rabani},
  publisher = {SIAM},
}