Abstract
A tree cover of a graph G is defined as a collection of trees such that their union includes all the vertices of G. The cost of a tree cover is the weight of the maximum weight tree in the tree cover. Given a positive integer k, the k-tree cover problem is to compute a minimum cost tree cover which has no more than k trees. Star covers are defined analogously. Additionally, we may also be provided with a set of k vertices which are to serve as roots of the trees or stars. In this paper, we provide constant factor approximation algorithms for finding tree and star covers of graphs, in the rooted and un-rooted versions.
J. Könemann, R. Ravi and A. Sinha are supported by the National Science Foundation under grant No. 0105548 and the ALADDIN Center under NSF grant No. CCR-0122581. A. Sinha is also supported by a Carnegie Bosch Institute Fellowship.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arkin, E., Hassin, R., Levin, A.: Approximations for minimum and min-max vehicle routing problems (2003) (manuscript)
Bartal, Y., Charikar, M., Raz, D.: Approximating min-sum k-clustering in metric spaces. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 11–20 (2001)
Charikar, M., Panigrahy, R.: Clustering to minimize the sum of cluster diameters. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 1–10 (2001)
Chudak, F., Shmoys, D.: Improved approximation algorithms for a capacitated facility location problem. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 875–876 (1999)
Diestel, R.: Graph Theory. Springer, Berlin (2000)
Dyer, M., Frieze, A.: A simple heuristic for the p-center problem. Operations Research Letters 3(6), 285–288 (1985)
Fakcharoenphol, J., Harrelson, C., Rao, S.: The k-traveling repairman problem. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 655–664 (2003)
Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. SIAM J. Computing 7, 178–193 (1978)
Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)
Guttman-Beck, N., Hassin, R.: Approximation algorithms for min-sum p-clustering. Discrete Applied Mathematics 89, 125–142 (1998)
Haimovich, M., Rinnooy Kan, A., Stougie, L.: Vehicle Routing: Methods and Studies. Elsevier, Amsterdam (1988)
Hochbaum, D., Shmoys, D.: A best possible approximation algorithm for the k-center problem. Mathematics of Operations Research 10(2), 180–184 (1985)
Levin, A.: Private communication (May 2003)
Shmoys, D., Tardos, E., Aardal, K.: Approximation algorithms for facility location problems. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 265–274 (1997)
Shmoys, D., Tardos, E.: An approximation algorithm for the generalized assignment problem. Mathematical Programming A 62, 461–474 (1993)
Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. SIAM monographs on discrete mathematics and applications (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Even, G., Garg, N., Könemann, J., Ravi, R., Sinha, A. (2003). Covering Graphs Using Trees and Stars. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds) Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques. RANDOM APPROX 2003 2003. Lecture Notes in Computer Science, vol 2764. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45198-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-45198-3_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40770-6
Online ISBN: 978-3-540-45198-3
eBook Packages: Springer Book Archive