The tree packing problem of Nash-Williams is a classical problem [2]. Here, one is given a
graph with nonnegative integral edge weights w: E→ N0. The goal is to pack a maximal …