{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:29:56Z","timestamp":1725791396009},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319060880"},{"type":"electronic","value":"9783319060897"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06089-7_17","type":"book-chapter","created":{"date-parts":[[2014,4,1]],"date-time":"2014-04-01T01:55:10Z","timestamp":1396317310000},"page":"248-258","source":"Crossref","is-referenced-by-count":6,"title":["Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems"],"prefix":"10.1007","author":[{"given":"Min","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tian","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weitian","family":"Tong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guohui","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/S0305-0548(99)00058-1","volume":"27","author":"F.F. Boctor","year":"2000","unstructured":"Boctor, F.F., Renaud, J.: The column-circular, subsets-selection problem: complexity and solutions. Computers & OR\u00a027, 383\u2013398 (2000)","journal-title":"Computers & OR"},{"key":"17_CR2","first-page":"27","volume":"98","author":"M. Dom","year":"2009","unstructured":"Dom, M.: Algorithmic aspects of the consecutive-ones property. Bulletin of the EATCS\u00a098, 27\u201359 (2009)","journal-title":"Bulletin of the EATCS"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Du, D., Ko, K., Hu, X.: Design and Analysis of Approximation Algorithms. Springer (2012)","DOI":"10.1007\/978-1-4614-1701-9"},{"key":"17_CR5","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company (1979)"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1016\/j.jda.2005.07.005","volume":"4","author":"J. Guo","year":"2006","unstructured":"Guo, J., Niedermeier, R.: Exact algorithms and applications for tree-like weighted set cover. J. Discrete Algorithms\u00a04, 608\u2013622 (2006)","journal-title":"J. Discrete Algorithms"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"3974","DOI":"10.1016\/j.ins.2010.06.035","volume":"180","author":"M. Gulek","year":"2010","unstructured":"Gulek, M., Toroslu, I.H.: A dynamic programming algorithm for tree-like weighted set packing problem. Information Sciences\u00a0180, 3974\u20133979 (2010)","journal-title":"Information Sciences"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-642-21204-8_26","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"W. Jiang","year":"2011","unstructured":"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.\u00a06681, pp. 233\u2013243. Springer, Heidelberg (2011)"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.tcs.2012.12.021","volume":"507","author":"W. Jiang","year":"2013","unstructured":"Jiang, W., Liu, T., Wang, C., Xu, K.: Feedback vertex sets on restricted bipartite graphs. Theor. Comput. Sci.\u00a0507, 41\u201351 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-642-22616-8_33","volume-title":"Combinatorial Optimization and Applications","author":"W. Jiang","year":"2011","unstructured":"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.\u00a06831, pp. 424\u2013434. Springer, Heidelberg (2011)"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. Karp","year":"1972","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-38756-2_16","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"M. Lu","year":"2013","unstructured":"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.\u00a07924, pp. 142\u2013152. Springer, Heidelberg (2013)"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/978-3-642-38768-5_65","volume-title":"Computing and Combinatorics","author":"Z. Lu","year":"2013","unstructured":"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.\u00a07936, pp. 721\u2013728. Springer, Heidelberg (2013)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-319-03780-6_24","volume-title":"Combinatorial Optimization and Applications","author":"Z. Lu","year":"2013","unstructured":"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.\u00a08287, pp. 272\u2013283. Springer, Heidelberg (2013)"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-29700-7_12","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"Y. Song","year":"2012","unstructured":"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.\u00a07285, pp. 129\u2013138. Springer, Heidelberg (2012)"},{"key":"17_CR16","unstructured":"Trick, M.A.: Induced subtrees of a tree and the set packing problem. IMA Preprint Series,\u00a0377 (1988)"},{"key":"17_CR17","unstructured":"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)"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-31770-5_9","volume-title":"Combinatorial Optimization and Applications","author":"C. Wang","year":"2012","unstructured":"Wang, C., Liu, T., Jiang, W., Xu, K.: Feedback vertex sets on tree convex bipartite graphs. In: Lin, G. (ed.) COCOA 2012. LNCS, vol.\u00a07402, pp. 95\u2013102. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06089-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T13:35:57Z","timestamp":1558877757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06089-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319060880","9783319060897"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06089-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}