Several Edge-Disjoint Spanning Trees with Given Diameter in a Graph with Random Discrete Edge Weights

We consider the problem of finding several edge-disjoint minimum total weight spanning trees of a given diameter in an undirected Graph with random edge weights, uniformly distributed on a discrete segment. We analyze \(\mathcal O(n^2)\) -time approximation algorithm and provide some sufficient conditions for this algorithm to be asymptotically optimal.