An easy proof of the ζ ( 2 ) limit in the random assignment problem.

Wästlund, Johan

Electronic Communications in Probability [electronic only] (2009)

  • Volume: 14, page 261-269
  • ISSN: 1083-589X

How to cite

top

Wästlund, Johan. "An easy proof of the limit in the random assignment problem.." Electronic Communications in Probability [electronic only] 14 (2009): 261-269. <http://eudml.org/doc/229533>.

@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 -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.