On the value of a random minimum weight Steiner tree
Let the edge weights of the complete graph on \(n\) vertices be chosen randomly and independently from an exponential distribution with parameter 1. Fix \(k=o(n)\) vertices. The weight of the minimum weight Steiner tree containing these vertices is approaching \((k-1)(\log n-\log k)/n\) with probability converging to 1.
scientific article; zbMATH DE number 2133932