Author:
FRIEZE ALAN,JOHANSSON TONY
Abstract
Assume that the edges of the complete graphKnare given independent uniform [0, 1] weights. We consider the expected minimum total weightμkofk⩽ 2 edge-disjoint spanning trees. Whenkis large we show thatμk≈k2. Most of the paper is concerned with the casek= 2. We show thatm2tends to an explicitly defined constant and thatμ2≈ 4.1704288. . . .
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Successive minimum spanning trees;Random Structures & Algorithms;2021-09-22
2. On distributed forest decomposition of graphs with bounded arboricity;2021 IEEE 11th Annual Computing and Communication Workshop and Conference (CCWC);2021-01-27
3. Successive shortest paths in complete graphs with random edge weights;Random Structures & Algorithms;2020-10-13