On the Expected Value of the Minimum Assignment

Random Structures and Algorithms

Volumn 21, Issue 1, 2002, Pages 33-58

  Buck, Marshall W ^a   Chan, Clara S ^a   Robbins, David P ^a  

^a CENTER FOR COMMUNICATIONS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (9)

1. D. J. Aldous, The ζ(2) limit in the random assignment problem, Random Struct Alg 18 (2001), 381-418. Also, http://arXiv.org/abs/math.PR/0010063.
2. S. E. Alm and G. B. Sorkin, Exact expectations and distributions for the random assignment problem, Combinatorics Probab Comput (2002), to appear; preprinted as IBM Research Report RC21620 (97480), December 1999.
3. M. Buck, C. Chan, and D. Robbins, On the expected value of the minimum assignment, 2000, http://arXiv.org/abs/math.CO/0004175.
4. D. Coppersmith and G. B. Sorkin, "On the expected incremental cost of a minimum assignment," B. Bollabas (Editor), Contemporary combinatorics, Bolyai Society Mathematical Studies 10 Springer-Verlag, New York, 2002, Chap. 8, to appear; preprinted as IBM Research Report RC21354 (96188), December 1998.
5. D. Coppersmith and G. B. Sorkin, Constructive bounds and exact expectations for the random assignment problem, Random Struct Alg 15(2) (1999), 113-144.
6. G. B. Dantzig, Linear programming and extensions, Princeton University Press, Princeton, NJ, 1963, pp. 135-136.
7. V. Dotsenko, Exact solution of the random bipartite matching model, J Phys A 33 (2000), 2015-2030. Also, http://arXiv.org/abs/cond-mat/9911477.
8. S. Linusson and J. Wästlund, A generalization of the random assignment problem, Preprint 2000, http://arXiv.org/abs/math.CO/0006146.
9. G. Parisi, A conjecture on random bipartite matching, Physics E-Print Archive, http://arXiv.org/abs/cond-mat/9801176, January 1998.