Minmax subtree cover problem on cacti
Discrete Applied Mathematics
Minmax Tree Cover in the Euclidean Space
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Minmax subtree cover problem on cacti
Discrete Applied Mathematics
Improved approximation algorithms for the min-max tree cover and bounded tree cover problems
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Approximation results for a min-max location-routing problem
Discrete Applied Mathematics
Approximation hardness of min-max tree covers
Operations Research Letters
| Hi-index | 0.00 |
Let G = (V, E) be a connected graph such that each edge e ∈ E and each vertex v ∈ V are weighted by nonnegative reals w(e) and h(v), respectively. Let r be a vertex designated as a root, and p be a positive integer. The minmax rooted-subtree cover problem (MRSC) asks to find a partition χ = {X1, X2, ..., Xp} of V and a set of p subtrees T1, T2, ..., Tp such that each Ti contains Xi ∪ {r} so as to minimize the maximum cost of the subtrees, where the cost of Ti is defined to be the sum of the weights of edges in Ti and the weights of vertices in Xi. Similarly, the minmax rooted-cycle cover problem (MRCC) asks to find a partition χ = {X1, X2, ..., Xp} of V and a set of p cycles C1, C2, ..., Cp such that Ci contains Xi ∪ {r} so as to minimize the maximum cost of the cycles, where the cost of Ci is defined analogously with the MRSC. In this paper, we first propose a (3-2/(p + 1))-approximation algorithm to the MRSC with a general graph G, and we then give a (6 - 4/(p + 1))-approximation algorithm to the MRCC with a metric (G, w).