Author:
Chebolu Prasad,Frieze Alan,Melsted Páll,Sorkin Gregory B.
Publisher
Springer Berlin Heidelberg
Reference27 articles.
1. Avram, F., Bertsimas, D.: The minimum spanning tree constant in geometrical probability and under the independent model: a unified approach. Annals of Applied Probability 2, 113–130 (1992)
2. Aldous, D.: Asymptotics in the random assignment problem. Pr. Th. Related Fields 93, 507–534 (1992)
3. Aldous, D.J.: The ζ(2) limit in the random assignment problem. Random Structures Algorithms 18(4), 381–418 (2001)
4. Archer, A., Tardos, É.: Frugal path mechanisms. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, January 06-08, 2002, pp. 991–999 (2002)
5. Archer, A., Tardos, É.: Frugal path mechanisms. ACM Trans. Algorithms 3(1), Art. 3, 22 (2007); MRMR2301829 (2008b:68013)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Successive minimum spanning trees;Random Structures & Algorithms;2021-09-22
2. The Min Mean-Weight Cycle in a Random Network;Combinatorics, Probability and Computing;2013-07-22