1. Angel, O., Flaxman, A.D., Wilson, D.B.: A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks.
arXiv:0810.4908v2
[math.PR], 5 May 2011
2. Cooper, C., Frieze, A., Ince, N., Janson, S., Spencer, J.: On the length of a random minimum spanning tree. Comb. Probab. Comput. 25(1), 89–107 (2016)
3. Frieze, A.: On the value of a random MST problem. Discrete Appl. Math. 10, 47–56 (1985)
4. Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, San Francisco (1979)
5. Gimadi, E.Kh., Perepelitsa, V.A.: Asymptotic approach for solving the traveling salesman problem. Upravlyaemye Sistemy 12, 35–45 (1974). (in Russian)