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}
}
  • A. Frieze, T. Tkocz
  • 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. 
    Shortest paths with a cost constraint: a probabilistic analysis

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 14 REFERENCES
    A randomly weighted minimum spanning tree with a random cost constraint
    2
    The Constrained Minimum Spanning Tree Problem (Extended Abstract)
    124
    Minimal spanning tree subject to a side constraint
    88
    A constrained minimum spanning tree problem
    39
    An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem
    19
    Integer and Combinatorial Optimization
    798
    Probability inequalities for sums of bounded random variables
    4818
    Combinatorial Optimization: Networks and Matroids
    • 1976
    Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston
    • 1976
    One
    134