liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
A proof of a conjecture of Buck, Chan, and Robbins on the expected value of the minimum assignment
Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Applied Mathematics.
2005 (English)In: Random structures & algorithms (Print), ISSN 1042-9832, Vol. 26, no 01-Feb, 237-251 p.Article in journal (Refereed) Published
Abstract [en]

We prove the main conjecture of the paper "On the expected value of the minimum assignment" by Marshall W. Buck, Clara S. Chan, and David P. Robbins [Random Structures Algorithms 21 (2002), 33-58]. This is an exact formula for the expected value of a certain type of random assignment problem. It generalizes the formula 1 + 1/4 + ...+ 1/n(2) for the n by n exp(1) random assignment problem. (C) 2005 Wiley Periodicals, Inc.

Place, publisher, year, edition, pages
2005. Vol. 26, no 01-Feb, 237-251 p.
National Category
Engineering and Technology
URN: urn:nbn:se:liu:diva-46137DOI: 10.1002/rsa.20066OAI: diva2:267033
Available from: 2009-10-11 Created: 2009-10-11 Last updated: 2011-01-12

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Wästlund, Johan
By organisation
The Institute of TechnologyApplied Mathematics
In the same journal
Random structures & algorithms (Print)
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 277 hits
ReferencesLink to record
Permanent link

Direct link