An extremal problem on random trees
From MaRDI portal
Publication:3923968
DOI10.1007/BF01069644zbMath0469.90084OpenAlexW2049960818MaRDI QIDQ3923968
Publication date: 1981
Published in: Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01069644
optimal strategypermutationpolynomial algorithmbranch and bound methodrandom treestrategy optimizationnecessary and sufficient optimality conditiondiscrete programmingsequential statistical analysis
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Numerical mathematical programming methods (65K05)
Related Items (1)
Cites Work
This page was built for publication: An extremal problem on random trees