On the random 2-stage minimum spanning tree

Random Structures and Algorithms

Volumn 28, Issue 1, 2006, Pages 24-36

  Flaxman, Abraham D ^a   Frieze, Alan ^a   Krivelevich, Michael ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33645287007     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20079     Document Type: Article

References (11)

1. D. Aldous, Asymptotics in the random assignment problem, Probab Theory Related Fields 93 (1992), 507-534.
2. D. Aldous, The ζ (2) limit in the random assignment problem. Random Structures Algorithms 18(2001), 381-418.
3. J. Birge and F. Louveaux, Introduction to stochastic programming, Springer, New York, 1997.
4. B. Bollobás, Random graphs, 2nd edition, Cambridge University Press, Cambridge, 2001.
5. S. Boucheron, G. Lugosi, and P. Massart, Concentration inequalities using the entropy method, Ann Probab 31 (2003), 1583-1614.
6. K. Dhamdere and M. Singh, Handling the random tree, manuscript.
7. A. M. Frieze, On the value of a random minimum spanning tree problem. Discrete Appl Math 10 (1985), 47-56.
8. A. Gupta, private communication.
9. S. Janson, T. Łuczak, D. E. Knuth, and B. G. Pittel, The birth of the giant component. Random Structures Algorithms 4 (1993), 233-357.
10. S. Linusson and J. Wästlund, A solution of Parisi's conjecture on the random assignment problem, Probab Theory Related Fields 128 (2004), 419-440.
11. C. Nair, B. Prabhakar, and M. Sharma, Proofs of the Parisi and Coppersmith-Sorkin conjectures for the finite random assignment problem, Proc 44th Annu IEEE Symp Found Comput, 2003, pp. 168-177.