Constructive bounds and exact expectations for the random assignment problem

Random Structures and Algorithms

Volumn 15, Issue 2, 1999, Pages 113-144

  Coppersmith, Don ^a   Sorkin, Gregory B ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Bipartite matching; Statistical physics; Weighted matching

Indexed keywords

EID: 0033424378     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199909)15:2<113::AID-RSA1>3.0.CO;2-S     Document Type: Article

References (23)

1. D. Aldous, Asymptotics in the random assignment problem, Pr Th Related Fields 93 (1992), 507-534.
2. S.E. Alm and G.B. Sorkin, On the expectation and variance of a minimum assignment, in preparation.
3. D. Coppersmith and G.B. Sorkin, On the expected incremental cost of a minimum assignment, Tech. Report RC21354 (96188), IBM Research Report, Yorktown Heights, NY, December 1998, accessible at http://domino.watson.ibm.com/library/CyberDig. nsf/home.
4. G.B. Dantzig, Linear programming and extensions, Princeton Univ. Press, Princeton, NJ, 1963.
5. M.E. Dyer, A.M. Frieze, and C.J.H. McDiarmid, On linear programs with random costs, Math Program 35 (1986), 3-16.
6. W.E. Donath, Algorithm and average-value bounds for assignment problems, IBM J Res Dev 13 (1969), 380-386.
7. T.E. Easterfield, A combinatorial algorithm, J Lond Math Soc 21 (1946), 219-226.
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. R.M. Karp, An upper bound on the expected cost of an optimal assignment, Tech. Report, Computer Science Division, University of California, Berkeley, CA, 1984.
10. R.M. Karp, An upper bound on the expected cost of an optimal assignment, Discrete algorithms and complexity: proceedings of the Japan-US Joint seminar, D.S. Johnson et al. (Editors), Perspectives in Computing, Vol. 15, Academic Press, 1987, pp. 1-4.
11. R.M. Karp, A.H.G. Rinnooy Kan, and R.V. Vohra, Average case analysis of a heuristic for the assignment problem, Math Oper Res 19 (1994), 513-522.
12. J.M. Kurtzberg, On approximation methods for the assignment problem, J Assoc Comput Mach 9 (1962), 419-439.
13. A.J. Lazarus, The assignment problem with uniform (0, 1) cost matrix, Master's thesis, Department of Mathematics, Princeton Univ., Princeton, NJ, 1979.
14. A.J. Lazarus, Certain expected values in the random assignment problem, Oper Res Lett 14 (1993), 207-214.
15. C. McDiarmid, On the method of bounded differences, Lond Math Soc Lecture Note Ser, vol. 141, Cambridge University Press, 1989, pp. 148-188.
16. M. Mézard and G. Parisi, Replicas and optimization, J Phys Lett 46 (1985), 771-778.
17. M. Mézard and G. Parisi, On the solution of the random link matching problems, J Phys Lett 48 (1987), 1451-1459.
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, Physics e-Print archive, http://xxx.lanl.gov/ps/cond-mat/9801176, January 1998.
20. P.M. Pardalos and K.G. Ramakrishnan, On the expected optimal value of random assignment problems: experimental results and open questions, Comput Optimiz Appl 2 (1993), 261-271.
21. B. Pittel and R.S. Weishaar, The random bipartite nearest neighbor graphs, submitted for publication.
22. J.M. Steele, Probability theory and combinatorial optimization, CBMS-NSF Regional Conference Series in Applied Mathematics, no. 69, Society for Industrial and Applied Mathematics, Philadelphia, 1997.
23. D.W. Walkup, On the expected value of a random assignment problem, SIAM J Comput 8 (1979), 440-442.