{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:08:03Z","timestamp":1758272883206,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030799861"},{"type":"electronic","value":"9783030799878"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79987-8_26","type":"book-chapter","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:05:05Z","timestamp":1625007905000},"page":"370-384","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Approximation Algorithms for Hitting Subgraphs"],"prefix":"10.1007","author":[{"given":"Noah","family":"Br\u00fcstle","sequence":"first","affiliation":[]},{"given":"Tal","family":"Elbaz","sequence":"additional","affiliation":[]},{"given":"Hamed","family":"Hatami","sequence":"additional","affiliation":[]},{"given":"Onur","family":"Kocer","sequence":"additional","affiliation":[]},{"given":"Bingchan","family":"Ma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,30]]},"reference":[{"issue":"2","key":"26_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF01844843","volume":"16","author":"R Aharoni","year":"1996","unstructured":"Aharoni, R., Holzman, R., Krivelevich, M.: On a theorem of Lov\u00e1sz on covers in $$r$$-partite hypergraphs. Combinatorica 16(2), 149\u2013174 (1996)","journal-title":"Combinatorica"},{"issue":"13\u201314","key":"26_CR2","doi-asserted-by":"publisher","first-page":"1943","DOI":"10.1016\/j.dam.2013.02.024","volume":"161","author":"B Bre\u0161ar","year":"2013","unstructured":"Bre\u0161ar, B., Jakovac, M., Katreni\u010d, J., Semani\u0161in, G., Taranenko, A.: On the vertex $$k$$-path cover. Discrete Appl. Math. 161(13\u201314), 1943\u20131949 (2013)","journal-title":"Discrete Appl. Math."},{"issue":"12","key":"26_CR3","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1016\/j.dam.2011.04.008","volume":"159","author":"B Bre\u0161ar","year":"2011","unstructured":"Bre\u0161ar, B., Kardo\u0161, F., Katreni\u010d, J., Semani\u0161in, G.: Minimum $$k$$-path vertex cover. Discrete Appl. Math. 159(12), 1189\u20131195 (2011)","journal-title":"Discrete Appl. Math."},{"unstructured":"Camby, E., Cardinal, J., Chapelle, M., Fiorini, S., Joret, G.: A primal-dual 3-approximation algorithm for hitting 4-vertex paths. In: The 9th International Colloquium on Graph Theory and Combinatorics, p. 61 (2014)","key":"26_CR4"},{"issue":"4\u20135","key":"26_CR5","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\u20135), 111\u2013118 (1998)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"26_CR6","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10107-019-01395-y","volume":"182","author":"S Fiorini","year":"2019","unstructured":"Fiorini, S., Joret, G., Schaudt, O.: Improved approximation algorithms for hitting 3-vertex paths. Math. Program. 182(1), 355\u2013367 (2019). https:\/\/doi.org\/10.1007\/s10107-019-01395-y","journal-title":"Math. Program."},{"issue":"3","key":"26_CR7","doi-asserted-by":"publisher","first-page":"1552","DOI":"10.1137\/16M1070670","volume":"31","author":"V Guruswami","year":"2017","unstructured":"Guruswami, V., Lee, E.: Inapproximability of $$H$$-transversal\/packing. SIAM J. Discrete Math. 31(3), 1552\u20131571 (2017)","journal-title":"SIAM J. Discrete Math."},{"issue":"50","key":"26_CR8","doi-asserted-by":"publisher","first-page":"7009","DOI":"10.1016\/j.tcs.2011.09.009","volume":"412","author":"F Kardo\u0161","year":"2011","unstructured":"Kardo\u0161, F., Katreni\u010d, J., Schiermeyer, I.: On computing the minimum 3-path vertex cover and dissociation number of graphs. Theor. Comput. Sci. 412(50), 7009\u20137017 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"26_CR9","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.ipl.2015.12.002","volume":"116","author":"J Katreni\u010d","year":"2016","unstructured":"Katreni\u010d, J.: A faster FPT algorithm for 3-path vertex cover. Inform. Process. Lett. 116(4), 273\u2013278 (2016)","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"26_CR10","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S Khot","year":"2008","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within $$2-\\epsilon $$. J. Comput. Syst. Sci. 74(3), 335\u2013349 (2008)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"26_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-018-1255-7","volume":"177","author":"E Lee","year":"2018","unstructured":"Lee, E.: Partitioning a graph into small pieces with applications to path transversal. Math. Program. 177(1), 1\u201319 (2018). https:\/\/doi.org\/10.1007\/s10107-018-1255-7","journal-title":"Math. Program."},{"issue":"14","key":"26_CR12","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1016\/j.ipl.2011.04.009","volume":"111","author":"J Tu","year":"2011","unstructured":"Tu, J., Zhou, W.: A factor 2 approximation algorithm for the vertex cover $$P_3$$ problem. Inform. Process. Lett. 111(14), 683\u2013686 (2011)","journal-title":"Inform. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79987-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:13:48Z","timestamp":1625008428000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79987-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030799861","9783030799878"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79987-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ottawa, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2021.eecs.uottawa.ca\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"107","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9.1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The workshop was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}