Corpus ID: 195833104

# A randomly weighted minimum arborescence with a random cost constraint

@article{Frieze2019ARW,
title={A randomly weighted minimum arborescence with a random cost constraint},
author={A. Frieze and T. Tkocz},
journal={ArXiv},
year={2019},
volume={abs/1907.03375}
}
• Published 2019
• Computer Science, Mathematics
• ArXiv
• We study the minimum spanning arborescence problem on the complete digraph $\vec{K}_n$ where an edge $e$ has a weight $W_e$ and a cost $C_e$, each of which is an independent uniform $[0,1]$ random variable. There is also a constraint that the spanning arborescence $T$ must satisfy $C(T)\leq c_0$. We establish the asymptotic value of the optimum weight via the consideration of a dual problem. The proof is via the analysis of a polynomial time algorithm.

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 14 REFERENCES
Minimal spanning tree subject to a side constraint
• Computer Science, Mathematics
• 1982
88
A constrained minimum spanning tree problem
• Mathematics, Computer Science
• 2000
39
Combinatorial Optimization: Networks and Matroids
• 1976
Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston
• 1976