Date of Original Version

11-19-2003

Type

Article

Abstract or Description

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.

DOI

10.1016/j.orl.2003.11.010

Share

COinS
 

Published In

Operations Research Letters , 32, 4, 309-315.