{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:47:48Z","timestamp":1759063668278,"version":"3.37.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T00:00:00Z","timestamp":1555891200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T00:00:00Z","timestamp":1555891200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s10107-019-01395-y","type":"journal-article","created":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T08:03:02Z","timestamp":1555920182000},"page":"355-367","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Improved approximation algorithms for hitting 3-vertex paths"],"prefix":"10.1007","volume":"182","author":[{"given":"Samuel","family":"Fiorini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7157-6694","authenticated-orcid":false,"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":[[2019,4,22]]},"reference":[{"issue":"4","key":"1395_CR1","doi-asserted-by":"publisher","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":"1395_CR2","unstructured":"Boral, A., Cygan, M., Kociumaka, T., Pilipczuk, M.: A fast branching algorithm for cluster vertex deletion, computer Science\u2014theory and applications. Lecture Notes in Computer Science, vol. 8476, pp.\u00a0111\u2013124. Springer (2014). \narXiv:1306.3877"},{"issue":"6","key":"1395_CR3","doi-asserted-by":"publisher","first-page":"1993","DOI":"10.1137\/S0097539798338163","volume":"30","author":"M Cai","year":"2001","unstructured":"Cai, M., 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":"1395_CR4","doi-asserted-by":"publisher","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":"1395_CR5","doi-asserted-by":"crossref","unstructured":"Fiorini, S., Joret, G., Schaudt, O.: Integer programming and combinatorial optimization. Lecture Notes in Computer Science, vol. 9682, pp.\u00a0238\u2013249. Springer (2016)","DOI":"10.1007\/978-3-319-33461-5_20"},{"key":"1395_CR6","unstructured":"Guruswami, V., Lee, E.: In Approximability of Feedback Vertex Set for Bounded Length Cycles, ECCC:TR14-006"},{"key":"1395_CR7","unstructured":"Guruswami, V., Lee, E.: Inapproximability of $$H$$-transversal\/packing. SIAM J. Discrete Math. 31(3), 1552\u20131571 (2017). \narXiv:1506.06302"},{"issue":"1","key":"1395_CR8","doi-asserted-by":"publisher","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. Theory Comput. Syst. 47(1), 196\u2013217 (2010)","journal-title":"Theory Comput. Syst."},{"key":"1395_CR9","doi-asserted-by":"crossref","unstructured":"Iwata, Y., Oka, K.: Fast dynamic graph algorithms for parameterized problems, Algorithm theory\u2014SWAT 2014. Lecture Notes in Computer Science, vol. 8503, pp.\u00a0241\u2013252. Springer (2014)","DOI":"10.1007\/978-3-319-08404-6_21"},{"key":"1395_CR10","unstructured":"Mnich, M., Williams, V.V., V\u00e9gh, L.A.: A $$7\/3$$-approximation for feedback vertex sets in tournaments. In: 24th Annual European Symposium on Algorithms, LIPIcs. Leibniz International Proceedings in Informatics, vol.\u00a057, Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern (2016). \nhttp:\/\/drops.dagstuhl.de\/opus\/volltexte\/2016\/6409\n\n, pp.\u00a0Art. No. 67, 14"},{"issue":"50","key":"1395_CR11","doi-asserted-by":"publisher","first-page":"7044","DOI":"10.1016\/j.tcs.2011.09.013","volume":"412","author":"J Tu","year":"2011","unstructured":"Tu, J., Zhou, W.: A primal-dual approximation algorithm for the vertex cover $${P}_3$$ problem. Theor. Comput. Sci. 412(50), 7044\u20137048 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"1395_CR12","unstructured":"You, J., Wang, J., Cao, Y.: Approximate association via dissociation. Discrete Appl. Math. 219, 202\u2013209 (2017). \narXiv:1510.08276"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01395-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-019-01395-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-019-01395-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T15:15:02Z","timestamp":1592925302000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-019-01395-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,22]]},"references-count":12,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["1395"],"URL":"https:\/\/doi.org\/10.1007\/s10107-019-01395-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2019,4,22]]},"assertion":[{"value":"30 August 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}