{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:10:15Z","timestamp":1743120615264,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031556005"},{"type":"electronic","value":"9783031556012"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-55601-2_12","type":"book-chapter","created":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T19:02:17Z","timestamp":1709665337000},"page":"177-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parameterized Approximation Algorithms for\u00a0Weighted Vertex Cover"],"prefix":"10.1007","author":[{"given":"Soumen","family":"Mandal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pranabendu","family":"Misra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashutosh","family":"Rai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,6]]},"reference":[{"issue":"17","key":"12_CR1","doi-asserted-by":"publisher","first-page":"1954","DOI":"10.1016\/j.dam.2011.07.009","volume":"159","author":"N Bourgeois","year":"2011","unstructured":"Bourgeois, N., Escoffier, B., Paschos, V.T.: Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms. Discret. Appl. Math. 159(17), 1954\u20131970 (2011)","journal-title":"Discret. Appl. Math."},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.tcs.2012.12.003","volume":"511","author":"L Brankovic","year":"2013","unstructured":"Brankovic, L., Fernau, H.: A novel parameterised approximation algorithm for minimum vertex cover. Theor. Comput. Sci. 511, 85\u2013108 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"12_CR3","doi-asserted-by":"publisher","first-page":"1188","DOI":"10.1016\/j.jcss.2008.05.002","volume":"74","author":"J Chen","year":"2008","unstructured":"Chen, J., Fomin, F.V., Liu, Y., Lu, S., Villanger, Y.: Improved algorithms for feedback vertex set problems. J. Comput. Syst. Sci. 74(7), 1188\u20131198 (2008)","journal-title":"J. Comput. Syst. Sci."},{"issue":"40\u201342","key":"12_CR4","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1016\/j.tcs.2010.06.026","volume":"411","author":"J Chen","year":"2010","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theoret. Comput. Sci. 411(40\u201342), 3736\u20133756 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Dinur, I., Khot, S., Kindler, G., Minzer, D., Safra, M.: Towards a proof of the 2-to-1 games conjecture? In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25\u201329, 2018, pp. 376\u2013389. ACM (2018)","DOI":"10.1145\/3188745.3188804"},{"issue":"6","key":"12_CR6","doi-asserted-by":"publisher","first-page":"146","DOI":"10.3390\/a13060146","volume":"13","author":"AE Feldmann","year":"2020","unstructured":"Feldmann, A.E., Karthik, C.S., Lee, E., Manurangsi, P.: A survey on approximation in parameterized complexity: hardness and algorithms. Algorithms 13(6), 146 (2020)","journal-title":"Algorithms"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.jcss.2017.11.001","volume":"93","author":"MR Fellows","year":"2018","unstructured":"Fellows, M.R., Kulik, A., Rosamond, F.A., Shachnai, H.: Parameterized approximation via fidelity preserving transformations. J. Comput. Syst. Sci. 93, 30\u201340 (2018)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/11940128_4","volume-title":"Algorithms and Computation","author":"FV Fomin","year":"2006","unstructured":"Fomin, F.V., Gaspers, S., Saurabh, S.: Branching and treewidth based exact algorithms. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 16\u201325. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11940128_4"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-031-15914-5_19","volume-title":"Graph-Theoretic Concepts in Computer Science: 48th International Workshop, WG 2022, T\u00fcbingen, Germany, June 22\u201324, 2022, Revised Selected Papers","author":"E Galby","year":"2022","unstructured":"Galby, E., Marx, D., Schepper, P., Sharma, R., Tale, P.: Parameterized complexity of\u00a0weighted multicut in\u00a0trees. In: Bekos, M.A., Kaufmann, M. (eds.) Graph-Theoretic Concepts in Computer Science: 48th International Workshop, WG 2022, T\u00fcbingen, Germany, June 22\u201324, 2022, Revised Selected Papers, pp. 257\u2013270. Springer International Publishing, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15914-5_19"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Proceedings of a symposium on the Complexity of Computer Computations, held March 20\u201322, 1972, pp. 85\u2013103. The IBM Research Symposia Series, Plenum Press, New York (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"3","key":"12_CR11","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."},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Kim, E.J., Kratsch, S., Pilipczuk, M., Wahlstr\u00f6m, M.: Directed flow-augmentation. In: STOC \u201922: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20\u201324, 2022, pp. 938\u2013947. ACM (2022)","DOI":"10.1145\/3519935.3520018"},{"key":"12_CR13","unstructured":"Kim, E.J., Pilipczuk, M., Sharma, R., Wahlstr\u00f6m, M.: On weighted graph separation problems and flow-augmentation. CoRR abs\/2208.14841 (2022)"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Kulik, A., Shachnai, H.: Analysis of two-variable recurrence relations with application to parameterized approximations, pp. 762\u2013773. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00076"},{"issue":"1","key":"12_CR15","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"GL Nemhauser","year":"1975","unstructured":"Nemhauser, G.L., Trotter, L.E.: Vertex packings: structural properties and algorithms. Math. Program. 8(1), 232\u2013248 (1975)","journal-title":"Math. Program."},{"issue":"2","key":"12_CR16","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0196-6774(03)00005-1","volume":"47","author":"R Niedermeier","year":"2003","unstructured":"Niedermeier, R., Rossmanith, P.: On efficient fixed-parameter algorithms for weighted vertex cover. J. Algorithms 47(2), 63\u201377 (2003)","journal-title":"J. Algorithms"},{"key":"12_CR17","volume-title":"What\u2019s next? future directions in parameterized complexity","author":"S Saurabh","year":"2017","unstructured":"Saurabh, S.: What\u2019s next? future directions in parameterized complexity. Recent Advances in Parameterized Complexity school, Tel Aviv (December (2017)"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.jcss.2017.05.003","volume":"89","author":"H Shachnai","year":"2017","unstructured":"Shachnai, H., Zehavi, M.: A multivariate framework for weighted FPT algorithms. J. Comput. Syst. Sci. 89, 157\u2013189 (2017)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","LATIN 2024: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-55601-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T19:04:44Z","timestamp":1709665484000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-55601-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031556005","9783031556012"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-55601-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"6 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Puerto Varas","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chile","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/latin2024.cmm.uchile.cl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"92","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":"44","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":"48% - 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.3","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}