Abstract
A set system is a collection of subsets of a given finite universe. A tree convex set system has a tree defined on the universe, such that each subset in the system induces a subtree. A circular convex set system has a circular ordering defined on the universe, such that each subset in the system induces a circular arc. A tree-like set system has a tree defined on the system, such that for each element in the universe, all subsets in the system containing this element induce a subtree. A circular-like set system has a circular ordering defined on the system, such that for each element in the universe, all subsets in the system containing this element induce a circular arc. In this paper, we restrict the trees to be stars, combs, triads, respectively, and restrict the set system to be unweighted. We show tractability of Triad Convex Set Cover, Circular-like Set Packing, and Triad-like Hitting Set, intractability of Comb Convex Set Cover and Comb-like Hitting Set. Our results not only complement the known results in literatures, but also rise interesting questions such as which other kind of trees will lead to tractability or intractability results of Set Cover, Set Packing and Hitting Set for tree convex and tree-like set systems.
Partially supported by National 973 Program of China (Grant No. 2010CB328103), Natural Science Foundation of China (Grant Nos. 61370052 and 61370156) and NSERC.
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
Boctor, F.F., Renaud, J.: The column-circular, subsets-selection problem: complexity and solutions. Computers & OR 27, 383–398 (2000)
Dom, M.: Algorithmic aspects of the consecutive-ones property. Bulletin of the EATCS 98, 27–59 (2009)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer (1999)
Du, D., Ko, K., Hu, X.: Design and Analysis of Approximation Algorithms. Springer (2012)
Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company (1979)
Guo, J., Niedermeier, R.: Exact algorithms and applications for tree-like weighted set cover. J. Discrete Algorithms 4, 608–622 (2006)
Gulek, M., Toroslu, I.H.: A dynamic programming algorithm for tree-like weighted set packing problem. Information Sciences 180, 3974–3979 (2010)
Jiang, W., Liu, T., Ren, T., Xu, K.: Two hardness results on feedback vertex sets. In: Atallah, M., Li, X.-Y., Zhu, B. (eds.) FAW-AAIM 2011. LNCS, vol. 6681, pp. 233–243. Springer, Heidelberg (2011)
Jiang, W., Liu, T., Wang, C., Xu, K.: Feedback vertex sets on restricted bipartite graphs. Theor. Comput. Sci. 507, 41–51 (2013)
Jiang, W., Liu, T., Xu, K.: Tractable feedback vertex sets in restricted bipartite graphs. In: Wang, W., Zhu, X., Du, D.-Z. (eds.) COCOA 2011. LNCS, vol. 6831, pp. 424–434. Springer, Heidelberg (2011)
Karp, R.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)
Lu, M., Liu, T., Xu, K.: Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs. In: Fellows, M., Tan, X., Zhu, B. (eds.) FAW-AAIM 2013. LNCS, vol. 7924, pp. 142–152. Springer, Heidelberg (2013)
Lu, Z., Liu, T., Xu, K.: Tractable Connected Domination for Restricted Bipartite Graphs (Extended Abstract). In: Du, D.-Z., Zhang, G. (eds.) COCOON 2013. LNCS, vol. 7936, pp. 721–728. Springer, Heidelberg (2013)
Lu, Z., Lu, M., Liu, T., Xu, K.: Circular convex bipartite graphs: Feedback vertex set. In: Widmayer, P., Xu, Y., Zhu, B. (eds.) COCOA 2013. LNCS, vol. 8287, pp. 272–283. Springer, Heidelberg (2013)
Song, Y., Liu, T., Xu, K.: Independent domination on tree convex bipartite graphs. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) FAW-AAIM 2012. LNCS, vol. 7285, pp. 129–138. Springer, Heidelberg (2012)
Trick, M.A.: Induced subtrees of a tree and the set packing problem. IMA Preprint Series, 377 (1988)
Wang, C., Chen, H., Lei, Z., Tang, Z., Liu, T., Xu, K.: NP-Completeness of Domination, Hamiltonicity and Treewidth for Restricted Bipartite Graphs (submitted, 2014)
Wang, C., Liu, T., Jiang, W., Xu, K.: Feedback vertex sets on tree convex bipartite graphs. In: Lin, G. (ed.) COCOA 2012. LNCS, vol. 7402, pp. 95–102. Springer, Heidelberg (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Lu, M., Liu, T., Tong, W., Lin, G., Xu, K. (2014). Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems. In: Gopal, T.V., Agrawal, M., Li, A., Cooper, S.B. (eds) Theory and Applications of Models of Computation. TAMC 2014. Lecture Notes in Computer Science, vol 8402. Springer, Cham. https://doi.org/10.1007/978-3-319-06089-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-06089-7_17
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-06088-0
Online ISBN: 978-3-319-06089-7
eBook Packages: Computer ScienceComputer Science (R0)