We provide constant factor
approximation algorithms for covering the nodes of a graph using trees (rooted
or unrooted), under the objective function of
minimizing the weight of the maximum weight tree, subject to an upper bound on
the number of trees used. These problems are related to location routing and
traveling salesperson problems.