Optimality of belief propagation for random assignment problem

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 187-196

  Salez, J ^a   Shah, D ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

ASSIGNMENT PROBLEMS; BELIEF PROPAGATION; BIPARTITE GRAPHS; LIGHT-TAILED DISTRIBUTION; OPTIMAL COMPUTATION; PERFECT MATCHINGS; RANDOM ASSIGNMENT PROBLEMS; RANDOM INSTANCE;

COMBINATORIAL OPTIMIZATION;

EID: 70349144047     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.22     Document Type: Conference Paper

References (17)

1. D. Aldous. Asymptotics in the random assignment problem. Prob. Th. Rel. Fields, 93:507-534, 1992.
2. D. Aldous. The ζ(2) limit in the random assignment problem. Random Struct. Algo., 18:381-418, 2001.
3. D. Aldous and A. Bandyopadhyay. A survey of max-type recursive distributional equations. Ann. of App. Prob., 15(2):1047-1110, 2005.
4. D. Aldous and J. Steele. The objective method: Probabilistic combinatorial optimization and local weak convergence. Discr. Comb. Prob., 2003.
5. A. Bandyopadhyay. Bivariate uniqueness in the logistic recursive distributional equation. Technical Report 629, Dept. of Stat., University of Cal., Berkeley, CA, 2002.
6. M. Bayati, D. Shah, and M. Sharma. Max-product for maximum weight matching: convergence, correctness and lp duality. IEEE Trans. Info. Th., March 2008.
7. D. Coppersmith and G. Sorkin. Constructive bounds and exact expectations for the random assignment problem. Random Struct. Algo., 15:113-144, 1999.
8. M. Dyer, A. Frieze, and C.J.H. McDiarmid. On linear programs with random costs. Math. Prog., 35:3-16, 1986.
9. J. Edmonds and R. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. J. of the ACM, 19:248-264, 1972.
10. R. Karp. An upper bound on the expected cost of an optimal assignment. Discr. Algo. Complexity: Proc. Japan- U.S. Joint Seminar, Academic Press, pages 1-4, 1987.
11. A. Lazarus. Certain expected values in the random assignment problem. Oper. Res. Lett., 14:207-214, 1993.
12. S. Linusson and J. Wȧstlund. A proof of parisiSs conjecture on the random assignment problem. Prob. Th. Rel. Fields, 128:419-440, 2004.
13. M. Mézard and G. Parisi. On the solution of the random link matching problem. J. of Physics, 48:1451-1459, 1987.
14. C. Nair, B. Prabhakar, and M. Sharma. Proofs of the parisi and coppersmith-sorkin random assignment conjectures. Random Struct. Algo., 27(4):413-444, 2005.
15. J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Francisco, CA, 1988.
16. D. Walkup. On the expected value of a random assignment problem. SIAM J. Comp., 8:440-442, 1979.
17. J. Yedidia, W. Freeman, and Y. Weiss. Generalized belief propagation. Technical Report TR-2000-26, Mitsubishi Elect. Res. Lab., Cambridge, MA, 2000.