An easy proof of the $\zeta \left(2\right)$ limit in the random assignment problem.

@article{Wästlund2009,
author = {Wästlund, Johan},
journal = {Electronic Communications in Probability [electronic only]},
keywords = {minimum matching; graph; exponential},
language = {eng},
pages = {261-269},
publisher = {University of Washington},
title = {An easy proof of the limit in the random assignment problem.},
url = {http://eudml.org/doc/229533},
volume = {14},
year = {2009},
}

TY - JOUR
AU - Wästlund, Johan
TI - An easy proof of the limit in the random assignment problem.
JO - Electronic Communications in Probability [electronic only]
PY - 2009
PB - University of Washington
VL - 14
SP - 261
EP - 269
LA - eng
KW - minimum matching; graph; exponential
UR - http://eudml.org/doc/229533
ER -