Given a rooted tree with a positive weight associated with every node, a linear algorithm is presented that will partition the tree into a minimum number of subtrees such that the sum of node weights in no subtree exceed a prespecified value k.
No takes yet. Share an insight, caveat, or question.
Kundu et al. (1977) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: