Proofs of the Parisi and Coppersmith-Sorkin Random assignment conjectures

Random Structures and Algorithms

Volumn 27, Issue 4, 2005, Pages 413-444

  Nair, Chandra ^a   Prabhakar, Balaji ^a   Sharma, Mayank ^a  

^a 350 Serra Mall ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 30544435390     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.20084     Document Type: Article

References (24)

1. D. J. Aldous, Asymptotics in the random assignment problem, Probab Theory Related Fields 93 (1992), 507-534.
2. D. J. Aldous, The ζ (2) limit in the random assignment problem, Random Structures Algorithms 18(2001), 381-418.
3. S. E. Aim and G. B. Sorkin, Exact expectations and distributions for the random assignment problem, Combinat Probab Comput 11(3) (2002). 217-248.
4. R. Brunetti, W. Krauth, M. Mezard, and G. Parisi, Extensive numerical simulations of weighted matchings: Total length and distribution of links in the optimal solution, Europhys Lett 14 (1991), 295.
5. M. W. Buck, C. S. Chan, and D. P. Robbins, On the expected value of the minimum assignment, Random Structures Algorithms 21 (2002), 33-58.
6. D. Coppersmith and G. Sorkin, Constructive bounds and exact expectations for the random assignment problem, Random Structures Algorithms 15 (1999), 113-144.
7. D. Coppersmith and G. Sorkin, "On the expected incremental cost of a minimum assignment," Contemporary combinatories, Ed., B. Bollobas, Bolyai Society Mathematical Studies, Volume 10, Chapter 8. Springer, New York, 2002.
8. M. X. Goemans and M. S. Kodialam, A lower bound on the expected cost of an optimal assignment, Math Oper Res 18 (1993), 267-274.
9. S. Janson, One, two and three times log n/n for paths in a complete graph with random weights, Combination Probab Compu 8 (1999), 347-361.
10. R. M. Karp, An upper bound on the expected cost of an optimal assignment, Discrete Algorithms and Complexity, Proc Japan-U.S Joint Sem, Academic, New York. 1987, pp. 1-4.
11. R. M. Karp, A. H. G. Rinnooy Kan, and R. Vohra, Average case analysis of a heuristic for the assignment problem, Math Oper Res, 19(3) (1994), 513-522.
12. A. Lazarus, Certain expected values in the random assignment problem, Oper Res Lett 14 (1993), 207-214.
13. S. Linusson and J. Wästlund, A generalization of the random assignment problem, http://www.mai.liu.se/~svlin/
14. S. Linusson and J. Wästlund, A proof of Parisi's Conjecture on the random assignment problem, Probabil Theory Related Fields 128(3) (2004), 419-440, http://www.mai.liu.se/~svlin/
15. M. Mézard and G. Parisi, On the solution of the random link matching problem, J Physique 48 (1987), 1451-1459.
16. M. Mézard. G. Parisi. and M. A. Virasoro, Spin glass theory and beyond, World Scientific, Singapore. 1987.
17. C. Nair, Towards the resolution of Coppersmith-Sorkin Conjectures, Proc 40th Annu Allerton Conf Communication, Control and Computing, Allerton, Illinois, 2002, 667-673.
18. B. Olin, Asymptotic properties of random assignment problems, Ph.D. thesis, Kungl Tekniska Högskolan. Stockholm, Sweden. 1992.
19. G. Parisi, A conjecture on random bipartite matching, Technical Report cond-mat/9801176, XXX LANL Archive, Allerton, Illinois, 1998, 657-666.
20. M. Sharma and B. Prabhakar. On Parisi's Conjecture for the finite random assignment problem, Proc 40th Annu Allerton Conf Communication, Control and Computing, 2002.
21. J. M. Steele, Probability theory and combinatorial optimization, CBMS-NSF Regional Conference Series in Applied Mathematics 69, SIAM, Philadelphia, PA, 1997.
22. M. Talagrand, An assignment problem at high temperature, Ann Probab, 31(2) (2003), 818-848.
23. D. W. Walkup, On the expected value of a random assignment problem, SIAM J Comput 8 (1979), 440-442.
24. J. Wästlund, A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment, Random Structures Algorithms 26(1-2) (2004), 237-251.