{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T15:50:08Z","timestamp":1748015408675,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030677305"},{"type":"electronic","value":"9783030677312"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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":"http:\/\/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-67731-2_21","type":"book-chapter","created":{"date-parts":[[2021,1,20]],"date-time":"2021-01-20T10:05:07Z","timestamp":1611137107000},"page":"293-307","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Parameterized Complexity of d-Hitting Set with Quotas"],"prefix":"10.1007","author":[{"given":"Sushmita","family":"Gupta","sequence":"first","affiliation":[]},{"given":"Pallavi","family":"Jain","sequence":"additional","affiliation":[]},{"given":"Aditya","family":"Petety","sequence":"additional","affiliation":[]},{"given":"Sagar","family":"Singh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,11]]},"reference":[{"issue":"7","key":"21_CR1","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.jcss.2009.09.002","volume":"76","author":"FN Abu-Khzam","year":"2010","unstructured":"Abu-Khzam, F.N.: A kernelization algorithm for d-hitting set. J. Comput. Syst. Sci. 76(7), 524\u2013531 (2010)","journal-title":"J. Comput. Syst. Sci."},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"B-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications (2001)","DOI":"10.1007\/978-1-4471-3886-0"},{"key":"21_CR3","unstructured":"Banerjee, S., Mathew, R., Panolan, F.: \u2018target set selection\u2019 on graphs of bounded vertex cover number (2018)"},{"key":"21_CR4","unstructured":"Bannach, M., Skambath, M., Tantau, T.: Kernelizing the hitting set problem in linear sequential and constant parallel time. In: 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020) (2020)"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Bannach, M., Tantau, T.: Computing hitting set kernels by ac 0-circuits. Theor. Comput. Syst. 1\u201326 (2019)","DOI":"10.1007\/s00224-019-09941-z"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-030-45771-6_6","volume-title":"Integer Programming and Combinatorial Optimization","author":"S Barman","year":"2020","unstructured":"Barman, S., Fawzi, O., Ghoshal, S., G\u00fcrp\u0131nar, E.: Tight approximation bounds for maximum multi-coverage. In: Bienstock, D., Zambelli, G. (eds.) IPCO 2020. LNCS, vol. 12125, pp. 66\u201377. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45771-6_6"},{"issue":"6\u20137","key":"21_CR7","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1016\/j.dam.2004.11.009","volume":"155","author":"P Berman","year":"2007","unstructured":"Berman, P., DasGupta, B., Sontag, E.: Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. Discrete Appl. Math. 155(6\u20137), 733\u2013749 (2007)","journal-title":"Discrete Appl. Math."},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"van Bevern, R., Smirnov, P.V.: Optimal-size problem kernels for $$ d $$-hitting set in linear time and space. arXiv preprint arXiv:2003.04578 (2020)","DOI":"10.1016\/j.ipl.2020.105998"},{"issue":"21","key":"21_CR9","first-page":"2151","volume":"249","author":"P Camion","year":"1959","unstructured":"Camion, P.: Chemins et circuits hamiltoniens des graphes complets. Comptes rendus hebdomadaires des s\u00e9ances de l\u2019Acad\u00e9mie des sciences 249(21), 2151\u20132152 (1959)","journal-title":"Comptes rendus hebdomadaires des s\u00e9ances de l\u2019Acad\u00e9mie des sciences"},{"key":"21_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Berlin (2015)"},{"issue":"2\u20133","key":"21_CR11","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0004-3702(92)90027-U","volume":"56","author":"J De Kleer","year":"1992","unstructured":"De Kleer, J., Mackworth, A.K., Reiter, R.: Characterizing diagnoses and systems. Artif. Intell. 56(2\u20133), 197\u2013222 (1992)","journal-title":"Artif. Intell."},{"key":"21_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity, vol. 4. Springer, Berlin (2013)"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.tcs.2014.03.029","volume":"555","author":"M El Ouali","year":"2014","unstructured":"El Ouali, M., Fohlin, H., Srivastav, A.: A randomised approximation algorithm for the hitting set problem. Theor. Comput. Sci. 555, 23\u201334 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"21_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3284176","volume":"66","author":"FV Fomin","year":"2019","unstructured":"Fomin, F.V., Gaspers, S., Lokshtanov, D., Saurabh, S.: Exact algorithms via monotone local search. J. ACM (JACM) 66(2), 1\u201323 (2019)","journal-title":"J. ACM (JACM)"},{"key":"21_CR15","volume-title":"Kernelization: Theory of Parameterized Preprocessing","author":"FV Fomin","year":"2019","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Zehavi, M.: Kernelization: Theory of Parameterized Preprocessing. Cambridge University Press, Cambridge (2019)"},{"key":"21_CR16","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 174 (1979)"},{"issue":"3","key":"21_CR17","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1089\/cmb.2007.0229","volume":"15","author":"UU Haus","year":"2008","unstructured":"Haus, U.U., Klamt, S., Stephen, T.: Computing knock-out strategies in metabolic networks. J. Comput. Biol. 15(3), 259\u2013268 (2008)","journal-title":"J. Comput. Biol."},{"issue":"9","key":"21_CR18","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1093\/bioinformatics\/btg047","volume":"19","author":"TR Hvidsten","year":"2003","unstructured":"Hvidsten, T.R., L\u00e6greid, A., Komorowski, J.: Learning rule-based models of biological process from gene expression time profiles using gene ontology. Bioinformatics 19(9), 1116\u20131123 (2003)","journal-title":"Bioinformatics"},{"issue":"6","key":"21_CR19","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1007\/s00224-019-09964-6","volume":"64","author":"P Jain","year":"2020","unstructured":"Jain, P., Kanesh, L., Misra, P.: Conflict free version of covering problems on graphs: Classical and parameterized. Theory Comput. Syst. 64(6), 1067\u20131093 (2020)","journal-title":"Theory Comput. Syst."},{"key":"21_CR20","unstructured":"Kutzkov, I., Scheder, D.: Computing minimum directed feedback vertex set in $$o(1.9977^n)$$. abs\/1007.1166 (2010)"},{"issue":"10","key":"21_CR21","doi-asserted-by":"publisher","first-page":"e13055","DOI":"10.1371\/journal.pone.0013055","volume":"5","author":"D Mellor","year":"2010","unstructured":"Mellor, D., Prieto, E., Mathieson, L., Moscato, P.: A kernelisation approach for multiple d-hitting set and its application in optimal multi-drug therapeutic combinations. PLoS One 5(10), e13055 (2010)","journal-title":"PLoS One"},{"key":"21_CR22","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.tcs.2013.07.019","volume":"506","author":"N Misra","year":"2013","unstructured":"Misra, N., Narayanaswamy, N., Raman, V., Shankar, B.S.: Solving min ones 2-sat as fast as vertex cover. Theor. Comput. Sci. 506, 115\u2013121 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR23","volume-title":"Topics on Tournaments in Graph Theory","author":"JW Moon","year":"2015","unstructured":"Moon, J.W.: Topics on Tournaments in Graph Theory. Courier Dover Publications, United States (2015)"},{"issue":"1","key":"21_CR24","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S1570-8667(03)00009-1","volume":"1","author":"R Niedermeier","year":"2003","unstructured":"Niedermeier, R., Rossmanith, P.: An efficient fixed-parameter algorithm for 3-hitting set. J. Discrete Algorithms 1(1), 89\u2013102 (2003)","journal-title":"J. Discrete Algorithms"},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Shi, L., Cai, X.: An exact fast algorithm for minimum hitting set. In: 2010 Third International Joint Conference on Computational Science and Optimization, vol. 1, pp. 64\u201367 (2010)","DOI":"10.1109\/CSO.2010.240"},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"Speckenmeyer, E.: On feedback problems in digraphs. In: International Workshop on Graph-Theoretic Concepts in Computer Science, pp. 218\u2013231 (1989)","DOI":"10.1007\/3-540-52292-1_16"},{"issue":"1","key":"21_CR27","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1186\/1752-0509-3-81","volume":"3","author":"A Vazquez","year":"2009","unstructured":"Vazquez, A.: Optimal drug combinations and minimal hitting sets. BMC Syst. Biol. 3(1), 81 (2009)","journal-title":"BMC Syst. Biol."},{"key":"21_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/BFb0023824","volume-title":"LATIN \u201992","author":"W Fernandez de la Vega","year":"1992","unstructured":"Fernandez de la Vega, W., Paschos, V.T., Saad, R.: Average case analysis of a greedy algorithm for the minimum hitting set problem. In: Simon, I. (ed.) LATIN 1992. LNCS, vol. 583, pp. 130\u2013138. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/BFb0023824"},{"key":"21_CR29","unstructured":"Wahlstr\u00f6m, M.: Algorithms, measures and upper bounds for satisfiability and related problems. Ph.D. thesis, Doctoral dissertation, Department of Computer and Information Science, Link\u00f6pings universitet (2007)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2021: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67731-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T22:01:43Z","timestamp":1619301703000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-67731-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030677305","9783030677312"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67731-2_21","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":"11 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bolzano-Bozen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"25 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"47","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sofsem2021.inf.unibz.it\/","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":"100","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":"33","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":"7","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":"33% - 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":"4,5","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 was held virtually 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)"}}]}}