| Article ID: | iaor20051035 |
| Country: | Netherlands |
| Volume: | 32 |
| Issue: | 4 |
| Start Page Number: | 309 |
| End Page Number: | 315 |
| Publication Date: | Jul 2004 |
| Journal: | Operations Research Letters |
| Authors: | Ravi R., Garg N., Sinha Amitabh, Even G., Knemann Jochen |
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.