A Randomly Weighted Minimum Spanning Tree with a Random Cost Constraint
Keyword(s):
We study the minimum spanning tree problem on the complete graph $K_n$ where an edge $e$ has a weight $W_e$ and a cost $C_e$, each of which is an independent copy of the random variable $U^\gamma$ where $\gamma\leq 1$ and $U$ is the uniform $[0,1]$ random variable. There is also a constraint that the spanning tree $T$ must satisfy $C(T)\leq c_0$. We establish, for a range of values for $c_0,\gamma$, the asymptotic value of the optimum weight via the consideration of a dual problem.
2021 ◽
Vol 1077
(1)
◽
pp. 012071
2005 ◽
Vol 164
(3)
◽
pp. 773-788
◽
1992 ◽
Vol 23
(3)
◽
pp. 1-12
◽
Keyword(s):
2009 ◽
Vol 36
(11)
◽
pp. 2969-2982
◽
1985 ◽
Vol 10
(1)
◽
pp. 47-56
◽
2018 ◽
Vol 265
(2)
◽
pp. 478-487
◽
2002 ◽
Vol 118
(1-2)
◽
pp. 43-54
◽
2003 ◽
Vol 12
(3)
◽
pp. 350-359