An extremal problem on random trees
From MaRDI portal
Publication:3923968
DOI10.1007/BF01069644zbMath0469.90084MaRDI QIDQ3923968
Publication date: 1981
Published in: Cybernetics (Search for Journal in Brave)
optimal strategy; permutation; polynomial algorithm; branch and bound method; random tree; strategy optimization; necessary and sufficient optimality condition; discrete programming; sequential statistical analysis
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
05C05: Trees
65K05: Numerical mathematical programming methods
Related Items
Cites Work