Abstract
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a rooted directed tree such that either head or tail (or both of them) of every arc in G is touched by T. The minimum directed tree cover problem (DTCP) is to find a directed tree cover of minimum cost. The problem is known to be NP-hard. In this paper, we show that the weighted Set Cover Problem (SCP) is a special case of DTCP. Hence, one can expect at best to approximate DTCP with the same ratio as for SCP. We show that this expectation can be satisfied in some way by designing a purely combinatorial approximation algorithm for the DTCP and proving that the approximation ratio of the algorithm is max {2, ln (D + )} with D + is the maximum outgoing degree of the nodes in G.
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.
Similar content being viewed by others
References
Arkin, E.M., Halldórsson, M.M., Hassin, R.: Approximating the tree and tour covers of a graph. Information Processing Letters 47, 275–282 (1993)
Arora, S., Sudan, M.: Improved Low-Degree Testing and Its Applications. In: Proceedings of STOC 1997, pp. 485–495 (1997)
Bock, F.: An algorithm to construct a minimum spanning tree in a directed network. In: Developments in Operations Research, pp. 29–44. Gordon and Breach, NY (1971)
Charikar, M., Chekuri, C., Cheung, T., Dai, Z., Goel, A., Guha, S., Li, M.: Approximation Algorithms for Directed Steiner Problems. Journal of Algorithms 33, 73–91 (1999)
Chu, Y.J., Liu, T.H.: On the shortest arborescence of a directed graph. Science Sinica 14, 1396–1400 (1965)
Edmonds, J.: Optimum branchings. J. Research of the National Bureau of Standards 71B, 233–240 (1967)
Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM 45, 634–652 (1998)
Fujito, T.: On approximability of the independent/connected edge dominating set problems. Information Processing Letters 79, 261–266 (2001)
Fujito, T.: How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 431–442. Springer, Heidelberg (2006)
Garey, M.R., Johnson, D.S.: The rectilinear Steiner-tree problem is NP complete. SIAM J. Appl. Math. 32, 826–834 (1977)
Könemann, J., Konjevod, G., Parekh, O., Sinha, A.: Improved Approximations for Tour and Tree Covers. Algorithmica 38, 441–449 (2003)
Lund, C., Yannakakis, M.: On the hardness of approximating minimization problems. Journal of the ACM 41, 960–981 (1994)
Nguyen, V.H.: Approximation algorithms for metric tree cover and generalized tour and tree covers. RAIRO Operations Research 41(3), 305–315 (2007)
Nguyen, V.H.: A 2log2(n)-Approximation Algorithm for Directed Tour Cover. In: Proceedings of COCOA 2009. LNCS, vol. 5573, pp. 208–218. Springer, Heidelberg (2009)
Raz, R., Safra, R.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proceedings of STOC 1997, pp. 475–484 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nguyen, V.H. (2010). Approximation Algorithm for the Minimum Directed Tree Cover. In: Wu, W., Daescu, O. (eds) Combinatorial Optimization and Applications. COCOA 2010. Lecture Notes in Computer Science, vol 6509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17461-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-17461-2_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17460-5
Online ISBN: 978-3-642-17461-2
eBook Packages: Computer ScienceComputer Science (R0)