Min-Max Tree Covers of Graphs.pdf.pdf' (219.89 kB)
Min-Max Tree Covers of Graphs
journal contributionposted on 1986-05-01, 00:00 authored by G. Even, N. Garg, J. Könemann, Ramamoorthi RaviRamamoorthi Ravi, A. Sinha
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.