Capacitated minimum spanning tree

Capacitated minimum spanning tree is a variation of minimum spanning tree problem with a designated root node and a capacity constraint $c$ that ensures that all subtrees incident to the root node have no more than $c$ nodes. If the tree nodes have weights, then the capacity constrain may be interpreted as follows: the sum of weights in any subtree should be no greater than $c$.