Limit Laws for the Optimal Directed Tree with Random Costs

DOI10.1017/S0963548397003052zbMATH Open0895.60030OpenAlexW2055762112MaRDI QIDQ4354591FDOQ4354591

Jennie C. Hansen

Publication date: 20 September 1998

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548397003052

Recommendations

• Near-optimal bounded-degree spanning trees
• Random minimal directed spanning trees and Dickman-type distributions
• The continuum random tree. I
• On the value of a random minimum spanning tree problem
• A randomly weighted minimum arborescence with a random cost constraint

zbMATH Keywords

optimization problemasymptotic behaviour of the moments of the order statisticsoptimal branchings in a complete directed graph

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Central limit and other weak theorems (60F05)

Cited In (2)

• Asymptotic cost of cutting down random free trees
• A limit law for the root value of minimax trees

This page was built for publication: Limit Laws for the Optimal Directed Tree with Random Costs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4354591)