Lower bound for the cost of connecting tree with given vertex degree sequence.

Mikhail V. Goubko Alexander V. Kuznetsov

Published in: CoRR (2018)

Keyphrases

lower bound
upper bound
optimal cost
tree structure
branch and bound algorithm
branch and bound
worst case
objective function
np hard
optimal solution
special case
multi dimensional
total cost
lower and upper bounds
expected cost
directed graph
storage space
tree structures
lower bounding
minimum weight