{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:17:06Z","timestamp":1742959026982,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031304477"},{"type":"electronic","value":"9783031304484"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-30448-4_16","type":"book-chapter","created":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T20:29:36Z","timestamp":1682368176000},"page":"217-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximating Power Node-Deletion Problems"],"prefix":"10.1007","author":[{"given":"Toshihiro","family":"Fujito","sequence":"first","affiliation":[]},{"given":"Kneto","family":"Mukae","sequence":"additional","affiliation":[]},{"given":"Junya","family":"Tsuzuki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,25]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-662-48971-0_32","volume-title":"Algorithms and Computation","author":"E Angel","year":"2015","unstructured":"Angel, E., Bampis, E., Chau, V., Kononov, A.: Min-power covering problems. In: Elbassioni, K., Makino, K. (eds.) ISAAC 2015. LNCS, vol. 9472, pp. 367\u2013377. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48971-0_32"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-662-53536-3_9","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"E Angel","year":"2016","unstructured":"Angel, E., Bampis, E., Escoffier, B., Lampis, M.: Parameterized power vertex cover. In: Heggernes, P. (ed.) WG 2016. LNCS, vol. 9941, pp. 97\u2013108. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53536-3_9"},{"issue":"3","key":"16_CR3","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1137\/S0895480196305124","volume":"12","author":"V Bafna","year":"1999","unstructured":"Bafna, V., Berman, P., Fujito, T.: A $$2$$-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Discrete Math. 12(3), 289\u2013297 (1999)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"16_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1287\/opre.1100.0851","volume":"59","author":"B Balasundaram","year":"2011","unstructured":"Balasundaram, B., Butenko, S., Hicks, I.V.: Clique relaxations in social network analysis: the maximum $$k$$-plex problem. Oper. Res. 59(1), 133\u2013142 (2011)","journal-title":"Oper. Res."},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/jagm.2000.1150","volume":"39","author":"R Bar-Yehuda","year":"2001","unstructured":"Bar-Yehuda, R.: Using homogeneous weights for approximating the partial cover problem. J. Algorithms 39(2), 137\u2013144 (2001)","journal-title":"J. Algorithms"},{"issue":"1","key":"16_CR6","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0004-3702(95)00004-6","volume":"83","author":"A Becker","year":"1996","unstructured":"Becker, A., Geiger, D.: Optimization of Pearl\u2019s method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem. Artif. Intell. 83(1), 167\u2013188 (1996)","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"16_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.dam.2011.08.013","volume":"160","author":"N Betzler","year":"2012","unstructured":"Betzler, N., Bredereck, R., Niedermeier, R., Uhlmann, J.: On bounded-degree vertex deletion parameterized by treewidth. Discrete Appl. Math. 160(1\u20132), 53\u201360 (2012)","journal-title":"Discrete Appl. Math."},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/BFb0028569","volume-title":"STACS 98","author":"NH Bshouty","year":"1998","unstructured":"Bshouty, N.H., Burroughs, L.: Massaging a linear programming solution to give a 2-approximation for a generalization of the vertex cover problem. In: Morvan, M., Meinel, C., Krob, D. (eds.) STACS 1998. LNCS, vol. 1373, pp. 298\u2013308. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0028569"},{"key":"16_CR9","unstructured":"Cao, Y.: A naive algorithm for feedback vertex set. In: 1st Symposium on Simplicity in Algorithms, volume 61 of OASIcs Open Access Series Informatics, Article no. 1, p. 9. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern (2018)"},{"issue":"11","key":"16_CR10","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pcbi.1000234","volume":"4","author":"C Chauve","year":"2008","unstructured":"Chauve, C., Tannier, E.: A methodological framework for the reconstruction of contiguous regions of ancestral genomes and its application to mammalian genomes. PLoS Comput. Biol. 4(11), e1000234 (2008)","journal-title":"PLoS Comput. Biol."},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-14355-7_10","volume-title":"Algorithmic Aspects in Information and Management","author":"Z-Z Chen","year":"2010","unstructured":"Chen, Z.-Z., Fellows, M., Fu, B., Jiang, H., Liu, Y., Wang, L., Zhu, B.: A linear kernel for co-path\/cycle packing. In: Chen, B. (ed.) AAIM 2010. LNCS, vol. 6124, pp. 90\u2013102. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14355-7_10"},{"issue":"2","key":"16_CR12","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1137\/S0097539703422479","volume":"36","author":"J Chuzhoy","year":"2006","unstructured":"Chuzhoy, J., Naor, J.: Covering problems with hard capacities. SIAM J. Comput. 36(2), 498\u2013515 (2006)","journal-title":"SIAM J. Comput."},{"key":"16_CR13","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: STOC\u201918\u2013Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp. 376\u2013389. ACM, New York (2018)","DOI":"10.1145\/3188745.3188804"},{"issue":"6","key":"16_CR14","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1016\/j.jcss.2010.12.001","volume":"77","author":"MR Fellows","year":"2011","unstructured":"Fellows, M.R., Guo, J., Moser, H., Niedermeier, R.: A generalization of Nemhauser and Trotter\u2019s local optimization theorem. J. Comput. System Sci. 77(6), 1141\u20131158 (2011)","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"16_CR15","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10878-013-9691-z","volume":"29","author":"Q Feng","year":"2015","unstructured":"Feng, Q., Wang, J., Li, S., Chen, J.: Randomized parameterized algorithms for $$P_2$$-packing and co-path packing problems. J. Comb. Optim. 29(1), 125\u2013140 (2015)","journal-title":"J. Comb. Optim."},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Fujito, T.: A unified local ratio approximation of node-deletion problems. In: Proceedings of the ESA\u201996, pp. 167\u2013178 (1996)","DOI":"10.1007\/3-540-61680-2_54"},{"issue":"2\u20133","key":"16_CR17","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0166-218X(98)00035-3","volume":"86","author":"T Fujito","year":"1998","unstructured":"Fujito, T.: A unified approximation algorithm for node-deletion problems. Discrete Appl. Math. 86(2\u20133), 213\u2013231 (1998)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"16_CR18","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0167-6377(99)00045-0","volume":"25","author":"T Fujito","year":"1999","unstructured":"Fujito, T.: On approximation of the submodular set cover problem. Oper. Res. Lett. 25(4), 169\u2013174 (1999)","journal-title":"Oper. Res. Lett."},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-319-57586-5_20","volume-title":"Algorithms and Complexity","author":"T Fujito","year":"2017","unstructured":"Fujito, T.: Approximating bounded degree deletion via matroid matching. In: Fotakis, D., Pagourtzis, A., Paschos, V.T. (eds.) CIAC 2017. LNCS, vol. 10236, pp. 234\u2013246. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57586-5_20"},{"issue":"4","key":"16_CR20","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"MR Garey","year":"1977","unstructured":"Garey, M.R., Johnson, D.S.: The rectilinear steiner tree problem is NP-complete. SIAM J. Appl. Math. 32(4), 826\u2013834 (1977)","journal-title":"SIAM J. Appl. Math."},{"key":"16_CR21","unstructured":"Gavril, F.: Cited in [20, page 134] (1974)"},{"issue":"1","key":"16_CR22","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/1125994.1125998","volume":"2","author":"R Hassin","year":"2006","unstructured":"Hassin, R., Levin, A.: The minimum generalized vertex cover problem. ACM Trans. Algorithms 2(1), 66\u201378 (2006)","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"16_CR23","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1006\/jagm.1998.0964","volume":"29","author":"DS Hochbaum","year":"1998","unstructured":"Hochbaum, D.S.: Approximating clique and biclique problems. J. Algorithms 29(1), 174\u2013200 (1998)","journal-title":"J. Algorithms"},{"issue":"4","key":"16_CR24","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/1597036.1597045","volume":"5","author":"G Karakostas","year":"2009","unstructured":"Karakostas, G.: A better approximation ratio for the vertex cover problem. ACM Trans. Algorithms 5(4), 8 (2009)","journal-title":"ACM Trans. Algorithms"},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Richard, M.K.: Reducibility among combinatorial problems. In: Complexity of computer computations (Proceeding Symposium, IBM Thomas J. Watson Research Center, Yorktown Heights, New York, 1972), pp. 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Khot, S.: On the power of unique 2-prover 1-round games. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 767\u2013775. ACM, New York (2002)","DOI":"10.1145\/509907.510017"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Khot, S., Minzer, D., Safra,M.: On independent sets, 2-to-2 games, and Grassmann graphs. In STOC\u201917\u2013Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pp. 576\u2013589. ACM, New York (2017)","DOI":"10.1145\/3055399.3055432"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Khot, S., Minzer, D., Safra, M.: Pseudorandom sets in Grassmann graph have near-perfect expansion. In: 59th Annual IEEE Symposium on Foundations of Computer Science\u2013FOCS 2018, pp. 592\u2013601. IEEE Computer Soc., Los Alamitos, CA (2018)","DOI":"10.1109\/FOCS.2018.00062"},{"issue":"3","key":"16_CR29","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. System Sci. 74(3), 335\u2013349 (2008)","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"16_CR30","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0022-0000(80)90060-4","volume":"20","author":"JM Lewis","year":"1980","unstructured":"Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. J. Comput. System Sci. 20(2), 219\u2013230 (1980)","journal-title":"J. Comput. System Sci."},{"key":"16_CR31","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-68874-4_10","volume-title":"Mathematical Programming: The State of the Art","author":"L Lov\u00e1sz","year":"1983","unstructured":"Lov\u00e1sz, L.: Submodular functions and convexity. In: Bachem, A., Korte, B., Gr\u00ebtschel, M. (eds.) Mathematical Programming: The State of the Art, pp. 235\u2013257. Springer, Berlin (1983)"},{"issue":"3","key":"16_CR32","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10878-011-9391-5","volume":"24","author":"H Moser","year":"2012","unstructured":"Moser, H., Niedermeier, R., Sorge, M.: Exact combinatorial algorithms and experiments for finding maximum $$k$$-plexes. J. Comb. Optim. 24(3), 347\u2013373 (2012)","journal-title":"J. Comb. Optim."},{"issue":"3","key":"16_CR33","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1137\/120890946","volume":"42","author":"I Newman","year":"2013","unstructured":"Newman, I., Sohler, C.: Every property of hyperfinite graphs is testable. SIAM J. Comput. 42(3), 1095\u20131112 (2013)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"16_CR34","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.ipl.2003.08.005","volume":"88","author":"M Okun","year":"2003","unstructured":"Okun, M., Barak, A.: A new approach for approximating node deletion problems. Inform. Process. Lett. 88(5), 231\u2013236 (2003)","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"16_CR35","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1080\/0022250X.1978.9989883","volume":"6","author":"SB Seidman","year":"1978","unstructured":"Seidman, S.B., Foster, B.L.: A graph-theoretic generalization of the clique concept. J. Math. Sociol. 6(1), 139\u2013154 (1978)","journal-title":"J. Math. Sociol."},{"issue":"4","key":"16_CR36","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF02579435","volume":"2","author":"LA Wolsey","year":"1982","unstructured":"Wolsey, L.A.: An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2(4), 385\u2013393 (1982)","journal-title":"Combinatorica"},{"key":"16_CR37","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.jcss.2016.08.003","volume":"84","author":"M Xiao","year":"2017","unstructured":"Xiao, M.: On a generalization of Nemhauser and Trotter\u2019s local optimization theorem. J. Comput. System Sci. 84, 97\u2013106 (2017)","journal-title":"J. Comput. System Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30448-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T03:33:07Z","timestamp":1729308787000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30448-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031304477","9783031304484"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30448-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Larnaca","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","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":"25","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":"51% - 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","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":"6","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":"3 invited papers","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)"}}]}}