{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:42:01Z","timestamp":1725856921116},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319334608"},{"type":"electronic","value":"9783319334615"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-33461-5_20","type":"book-chapter","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T18:35:59Z","timestamp":1464114959000},"page":"238-249","source":"Crossref","is-referenced-by-count":7,"title":["Improved Approximation Algorithms for Hitting 3-Vertex Paths"],"prefix":"10.1007","author":[{"given":"Samuel","family":"Fiorini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gwena\u00ebl","family":"Joret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliver","family":"Schaudt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,25]]},"reference":[{"issue":"2","key":"20_CR1","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","volume":"B 41","author":"H-J Bandelt","year":"1986","unstructured":"Bandelt, H.-J., Mulder, H.M.: Distance-hereditary graphs. J. Comb. Theory Ser. B 41(2), 182\u2013208 (1986)","journal-title":"J. Comb. Theory Ser."},{"issue":"4","key":"20_CR2","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/1041680.1041683","volume":"36","author":"R Bar-Yehuda","year":"2004","unstructured":"Bar-Yehuda, R., Bendel, K., Freund, A., Rawitz, D.: Local ratio: a unified framework for approximation algorithms. ACM Comput. Surv. 36(4), 422\u2013463 (2004)","journal-title":"ACM Comput. Surv."},{"key":"20_CR3","unstructured":"Anudhyan, B., Marek, C., Tomasz, K., Marcin, P.: A fast branching algorithm for cluster vertex deletion. In: Hirsch, Edward A., Kuznetsov, Sergei O., Pin, Jean-\u00c9ric, Vereshchagin, Nikolay K. (eds.) CSR 2014. LNCS, vol. 8476, pp. 111\u2013124. Springer, Heidelberg (2014). arXiv:1306.3877"},{"issue":"6","key":"20_CR4","doi-asserted-by":"crossref","first-page":"1993","DOI":"10.1137\/S0097539798338163","volume":"30","author":"X Deng","year":"2001","unstructured":"Deng, X., Zang, W.: An approximation algorithm for feedback vertex sets in tournaments. SIAM J. Comput. 30(6), 1993\u20132007 (2001)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"20_CR5","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/S0167-6377(98)00021-2","volume":"22","author":"FA Chudak","year":"1998","unstructured":"Chudak, F.A., Goemans, M.X., Hochbaum, D.S., Williamson, D.P.: A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs. Oper. res. lett. 22(4), 111\u2013118 (1998)","journal-title":"Oper. res. lett."},{"key":"20_CR6","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph Theory","author":"R Diestel","year":"2010","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173. Springer, Heidelberg (2010)"},{"key":"20_CR7","unstructured":"Guruswami, V., Lee, E.: Inapproximability of feedback vertex set for bounded length cycles. ECCC:TR14-006"},{"key":"20_CR8","unstructured":"Guruswami, V., Lee, E.: Inapproximability of $$H$$ -transversal\/packing. arXiv:1506.06302"},{"issue":"1","key":"20_CR9","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/s00224-008-9150-x","volume":"47","author":"F H\u00fcffner","year":"2010","unstructured":"H\u00fcffner, F., Komusiewicz, C., Moser, H., Niedermeier, R.: Fixed-parameter algorithms for cluster vertex deletion. Theor. Comput. Syst. 47(1), 196\u2013217 (2010)","journal-title":"Theor. Comput. Syst."},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/978-3-319-08404-6_21","volume-title":"Algorithm Theory \u2013 SWAT 2014","author":"Y Iwata","year":"2014","unstructured":"Iwata, Y., Oka, K.: Fast dynamic graph algorithms for parameterized problems. In: Ravi, R., G\u00f8rtz, I.L. (eds.) SWAT 2014. LNCS, vol. 8503, pp. 241\u2013252. Springer, Heidelberg (2014)"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/3-540-59071-4_41","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T Kloks","year":"1995","unstructured":"Kloks, T., Kratsch, D., M\u00fcller, H.: Dominoes. In: Mayr, E.W., Schmidt, G., Tinhofer, G. (eds.) WG 1994. LNCS, vol. 903, pp. 106\u2013120. Springer, Heidelberg (1995)"},{"key":"20_CR12","unstructured":"Mnich, M., Williams, V.V., V\u00e9gh, L.A.: A $$7, 3$$ -approximation for feedback vertex sets in tournaments. arXiv:1511.01137"},{"issue":"50","key":"20_CR13","doi-asserted-by":"crossref","first-page":"7044","DOI":"10.1016\/j.tcs.2011.09.013","volume":"412","author":"T Jianhua","year":"2011","unstructured":"Jianhua, T., Zhou, W.: A primal-dual approximation algorithm for the vertex cover $${P}_3$$ problem. Theoret. Comput. Sci. 412(50), 7044\u20137048 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR14","unstructured":"You, J., Wang, J., Cao, Y.: Approximate association via dissociation. arXiv:1510.08276"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-33461-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T10:51:58Z","timestamp":1498301518000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-33461-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319334608","9783319334615"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-33461-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}