Responsible for this page: David Lawrence, davla@ep.liu.se
Page last updated: 2007-05-15
|
LiU E-Press
Research from LiU
Electronic Publishing
About LiU E-Press
Creative Commons
LiU E-Press
Research from LiU
Electronic Publishing
About LiU E-Press
Creative Commons
| Files: | Description | File size | Format | |
| Fulltext | 162K | PDF (requires Acrobat Reader) | ||
| Author: | Johan Wästlund | |||
| Title: | The variance and higher moments in the random assignment problem | |||
| Language: | English | |||
| Issue: | 8 | |||
| Abstract [en]: | We obtain exact formulas for all moments of the cost Cn of the inimum assignment in the complete bipartite graph Kn,n with independent exp(1) edge costs. In particular we prove that as n tends to infinity, the variance of Cn is c/n+O(1/n2), where c = 4ζ(2)-4ζ(3), or approximately 1.7715. | |||
| Publisher: | Linköping University Electronic Press | |||
| Year: | 2005 | |||
| Available: | 2005-10-14 | |||
| Pages: | 21 | |||
| Series: | Linköping Studies in Mathematics | |||
| ISSN (print): | 0348-2960 | |||
| ISSN (online): | 1652-4454 | |||
| Checksum: | 78339cc644878f2559adbf2feb457a17 /home/ep/www/ea/lsm/2005/008/lsm05008.pdf (MD5) | |||
| PGP: | PGP | |||
| SPECIAL INFO: | Checksum, PGP and persistence | |||
REFERENCE TO THIS PAGE:
|
||||
Last updated: 2007-05-15