Optimality of belief propagation for random assignment problem

J. Salez, D. Shah. Optimality of belief propagation for random assignment problem. In Claire Mathieu, editor, Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009. pages 187-196, SIAM, 2009. [doi]

@inproceedings{SalezS09,
  title = {Optimality of belief propagation for random assignment problem},
  author = {J. Salez and D. Shah},
  year = {2009},
  doi = {10.1145/1496770.1496792},
  url = {http://doi.acm.org/10.1145/1496770.1496792},
  researchr = {https://researchr.org/publication/SalezS09},
  cites = {0},
  citedby = {0},
  pages = {187-196},
  booktitle = {Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009},
  editor = {Claire Mathieu},
  publisher = {SIAM},
}