{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T12:17:16Z","timestamp":1759580236963,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030489656"},{"type":"electronic","value":"9783030489663"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-48966-3_30","type":"book-chapter","created":{"date-parts":[[2020,5,28]],"date-time":"2020-05-28T13:04:23Z","timestamp":1590671063000},"page":"395-408","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs"],"prefix":"10.1007","author":[{"given":"Vahan","family":"Mkrtchyan","sequence":"first","affiliation":[]},{"given":"Garik","family":"Petrosyan","sequence":"additional","affiliation":[]},{"given":"K.","family":"Subramani","sequence":"additional","affiliation":[]},{"given":"Piotr","family":"Wojciechowski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,29]]},"reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1016\/j.jcss.2010.12.002","volume":"77","author":"O Amini","year":"2011","unstructured":"Amini, O., Fomin, F.V., Saurabh, S.: Implicit branching and parameterized partial cover problems. J. Comput. Syst. Sci. 77, 1159\u20131171 (2011)","journal-title":"J. Comput. Syst. Sci."},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-48777-8_2","volume-title":"Integer Programming and Combinatorial Optimization","author":"AA Ageev","year":"1999","unstructured":"Ageev, A.A., Sviridenko, M.I.: Approximation algorithms for maximum coverage and max cut with given sizes of parts. In: Cornu\u00e9jols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol. 1610, pp. 17\u201330. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48777-8_2"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.dam.2013.05.015","volume":"165","author":"N Apollonio","year":"2014","unstructured":"Apollonio, N., Simeone, B.: The maximum vertex coverage problem on bipartite graphs. Discrete Appl. Math. 165, 37\u201348 (2014)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"30_CR4","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1137\/130931059","volume":"28","author":"N Apollonio","year":"2014","unstructured":"Apollonio, N., Simeone, B.: Improved approximation of maximum vertex coverage problem on bipartite graphs. SIAM J. Discrete Math. 28(3), 1137\u20131151 (2014)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"30_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":"10","key":"30_CR6","first-page":"2181","volume":"57","author":"CC Bilgin","year":"2013","unstructured":"Bilgin, C.C., Caskurlu, B., Gehani, A., Subramani, K.: Analytical models for risk-based intrusion response. Comput. Netw. (Special issue on Security\/Identity Architecture) 57(10), 2181\u20132192 (2013)","journal-title":"Comput. Netw. (Special issue on Security\/Identity Architecture)"},{"issue":"6","key":"30_CR7","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0020-0190(02)00434-9","volume":"85","author":"M Bl\u00e4ser","year":"2003","unstructured":"Bl\u00e4ser, M.: Computing small partial coverings. Inf. Process. Lett. 85(6), 327\u2013331 (2003)","journal-title":"Inf. Process. Lett."},{"key":"30_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"},{"issue":"3","key":"30_CR9","doi-asserted-by":"publisher","first-page":"2172","DOI":"10.1137\/15M1054328","volume":"31","author":"B Caskurlu","year":"2017","unstructured":"Caskurlu, B., Mkrtchyan, V., Parekh, O., Subramani, K.: Partial vertex cover and budgeted maximum coverage in bipartite graphs. SIAM J. Discrete Math. 31(3), 2172\u20132184 (2017)","journal-title":"SIAM J. Discrete Math."},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-662-44602-7_2","volume-title":"Theoretical Computer Science","author":"B Caskurlu","year":"2014","unstructured":"Caskurlu, B., Mkrtchyan, V., Parekh, O., Subramani, K.: On partial vertex cover and budgeted maximum coverage problems in bipartite graphs. In: Diaz, J., Lanese, I., Sangiorgi, D. (eds.) TCS 2014. LNCS, vol. 8705, pp. 13\u201326. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44602-7_2"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms, pp. 3\u2013555. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3. ISBN 978-3-319-21274-6"},{"issue":"1","key":"30_CR12","doi-asserted-by":"publisher","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I Dinur","year":"2005","unstructured":"Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Ann. Math. 162(1), 439\u2013485 (2005)","journal-title":"Ann. Math."},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BFb0053968","volume-title":"Approximation Algorithms for Combinatiorial Optimization","author":"DS Hochbaum","year":"1998","unstructured":"Hochbaum, D.S.: The t-vertex cover problem: extending the half integrality framework with budget constraints. In: Jansen, K., Rolim, J. (eds.) APPROX 1998. LNCS, vol. 1444, pp. 111\u2013122. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0053968"},{"issue":"2","key":"30_CR14","first-page":"143","volume":"17","author":"G Joret","year":"2015","unstructured":"Joret, G., Vetta, A.: Reducing the rank of a matroid. Discrete Math. Theor. Comput. Sci. 17(2), 143\u2013156 (2015)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"4","key":"30_CR15","doi-asserted-by":"publisher","first-page":"1","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), 1\u20138 (2009)","journal-title":"ACM Trans. Algorithms"},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R Karp","year":"1972","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"30_CR17","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, 335\u2013349 (2008)","journal-title":"J. Comput. Syst. Sci."},{"unstructured":"Khot, S., Minzer, D., Safra, M.: Pseudorandom sets in Grassmann graph have near-perfect expansion. Electronic Colloquium on Computational Complexity, Report No. 6 (2018)","key":"30_CR18"},{"issue":"1","key":"30_CR19","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.jalgor.2004.04.002","volume":"53","author":"S Khuller","year":"2004","unstructured":"Khuller, S., Gandhi, R., Srinivasan, A.: Approximation algorithms for partial covering problems. J. Algorithms 53(1), 55\u201384 (2004)","journal-title":"J. Algorithms"},{"key":"30_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-540-92248-3_22","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J Kneis","year":"2008","unstructured":"Kneis, J., Langer, A., Rossmanith, P.: Improved upper bounds for partial vertex cover. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol. 5344, pp. 240\u2013251. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92248-3_22"},{"issue":"1","key":"30_CR21","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00453-007-9003-z","volume":"55","author":"J Mestre","year":"2009","unstructured":"Mestre, J.: A primal-dual approximation algorithm for partial vertex cover: making educated guesses. Algorithmica 55(1), 227\u2013239 (2009)","journal-title":"Algorithmica"},{"key":"30_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-540-75520-3_31","volume-title":"Algorithms \u2013 ESA 2007","author":"R Bar-Yehuda","year":"2007","unstructured":"Bar-Yehuda, R., Flysher, G., Mestre, J., Rawitz, D.: Approximation of partial capacitated vertex cover. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 335\u2013346. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75520-3_31"},{"key":"30_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-319-51963-0_27","volume-title":"SOFSEM 2017: Theory and Practice of Computer Science","author":"V Mkrtchyan","year":"2017","unstructured":"Mkrtchyan, V., Parekh, O., Segev, D., Subramani, K.: The approximability of partial vertex covers in trees. In: Steffen, B., Baier, C., van den Brand, M., Eder, J., Hinchey, M., Margaria, T. (eds.) SOFSEM 2017. LNCS, vol. 10139, pp. 350\u2013360. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-51963-0_27"},{"key":"30_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-540-69507-3_31","volume-title":"SOFSEM 2007: Theory and Practice of Computer Science","author":"J Kneis","year":"2007","unstructured":"Kneis, J., M\u00f6lle, D., Rossmanith, P.: Partial vs. complete domination: t-dominating set. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Pl\u00e1\u0161il, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, pp. 367\u2013376. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-69507-3_31"},{"doi-asserted-by":"crossref","unstructured":"Moss, A., Khuler, S., (Seffi) Naor, J.: The budgeted maximum coverage problem. Inf. Process. Lett. 70(1), 39\u201345 (1999)","key":"30_CR25","DOI":"10.1016\/S0020-0190(99)00031-9"},{"key":"30_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/11534273_5","volume-title":"Algorithms and Data Structures","author":"J Guo","year":"2005","unstructured":"Guo, J., Niedermeier, R., Wernicke, S.: Parameterized complexity of generalized vertex cover problems. In: Dehne, F., L\u00f3pez-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol. 3608, pp. 36\u201348. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11534273_5"},{"issue":"3","key":"30_CR27","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"CH Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43(3), 425\u2013440 (1991)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"30_CR28","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s00453-009-9317-0","volume":"59","author":"O Parekh","year":"2011","unstructured":"Parekh, O., K\u00f6nemann, J., Segev, D.: A unified approach to approximating partial covering problems. Algorithmica 59(4), 489\u2013509 (2011)","journal-title":"Algorithmica"},{"key":"30_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/11940128_60","volume-title":"Algorithms and Computation","author":"J Kneis","year":"2006","unstructured":"Kneis, J., M\u00f6lle, D., Richter, S., Rossmanith, P.: Intuitive algorithms and t-vertex cover. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 598\u2013607. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11940128_60"},{"unstructured":"Paschos, V.Th.: A polynomial time approximation schema for max $$k$$\u2013vertex cover in bipartite graphs (2019). https:\/\/arxiv.org\/abs\/1909.08435v1","key":"30_CR30"},{"key":"30_CR31","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, New York (2001)"}],"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-48966-3_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:17:48Z","timestamp":1710256668000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-48966-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030489656","9783030489663"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48966-3_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 May 2020","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":"Bordeaux","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2020.labri.fr\/","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":"62","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":"30","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,8","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":"5,9","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 conference had to be postponed due to the COVID-19 pandemic","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}