{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:01Z","timestamp":1759639081476,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030895426"},{"type":"electronic","value":"9783030895433"}],"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-89543-3_50","type":"book-chapter","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T02:03:25Z","timestamp":1634781805000},"page":"604-616","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constrained Hitting Set Problem with\u00a0Intervals"],"prefix":"10.1007","author":[{"given":"Ankush","family":"Acharyya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vahideh","family":"Keikha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diptapriyo","family":"Majumdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Supantha","family":"Pandit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,20]]},"reference":[{"issue":"7","key":"50_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."},{"issue":"7","key":"50_CR2","doi-asserted-by":"publisher","first-page":"1939","DOI":"10.1007\/s00453-020-00681-y","volume":"82","author":"A Agrawal","year":"2020","unstructured":"Agrawal, A., Jain, P., Kanesh, L., Saurabh, S.: Parameterized complexity of conflict-free matchings and paths. Algorithmica 82(7), 1939\u20131965 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00681-y","journal-title":"Algorithmica"},{"key":"50_CR3","volume-title":"The Design and Analysis of Computer Algorithms","author":"AV Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Boston (1974)"},{"issue":"7","key":"50_CR4","doi-asserted-by":"publisher","first-page":"3248","DOI":"10.1137\/090762968","volume":"39","author":"B Aronov","year":"2010","unstructured":"Aronov, B., Ezra, E., Sharir, M.: Small-size $$\\epsilon $$-nets for axis-parallel rectangles and boxes. SIAM J. Comput. 39(7), 3248\u20133282 (2010)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"50_CR5","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/0022-0000(80)90046-X","volume":"21","author":"G Ausiello","year":"1980","unstructured":"Ausiello, G., D\u2019Atri, A., Protasi, M.: Structure preserving reductions among convex optimization problems. J. Comput. Syst. Sci. 21(1), 136\u2013153 (1980)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"50_CR6","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF02570718","volume":"14","author":"H Br\u00f6nnimann","year":"1995","unstructured":"Br\u00f6nnimann, H., Goodrich, M.T.: Almost optimal set covers in finite VC-dimension. Discrete Comput. Geom. 14(4), 463\u2013479 (1995). https:\/\/doi.org\/10.1007\/BF02570718","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"50_CR7","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00454-006-1273-8","volume":"37","author":"KL Clarkson","year":"2007","unstructured":"Clarkson, K.L., Varadarajan, K.R.: Improved approximation algorithms for geometric set cover. Discrete Comput. Geom. 37(1), 43\u201358 (2007). https:\/\/doi.org\/10.1007\/s00454-006-1273-8","journal-title":"Discrete Comput. Geom."},{"unstructured":"Cornet, A., Laforest, C.: Total domination, connected vertex cover and Steiner tree with conflicts. Discrete Math. Theoret. Comput. Sci. 19(3) (2017)","key":"50_CR8"},{"key":"50_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-030-04651-4_13","volume-title":"Combinatorial Optimization and Applications","author":"A Cornet","year":"2018","unstructured":"Cornet, A., Laforest, C.: Graph problems with obligations. In: Kim, D., Uma, R.N., Zelikovsky, A. (eds.) COCOA 2018. LNCS, vol. 11346, pp. 183\u2013197. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04651-4_13"},{"issue":"3","key":"50_CR10","doi-asserted-by":"publisher","first-page":"41:1","DOI":"10.1145\/2925416","volume":"12","author":"M Cygan","year":"2016","unstructured":"Cygan, M., et al.: On problems as hard as CNF-SAT. ACM Trans. Algorithms 12(3), 41:1-41:24 (2016)","journal-title":"ACM Trans. Algorithms"},{"key":"50_CR11","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, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"issue":"2","key":"50_CR12","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/2650261","volume":"11","author":"M Dom","year":"2014","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Kernelization lower bounds through colors and ids. ACM Trans. Algorithms 11(2), 13:1-13:20 (2014)","journal-title":"ACM Trans. Algorithms"},{"issue":"4","key":"50_CR13","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of $$\\ln n$$ for approximating set cover. J. ACM 45(4), 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"50_CR14","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-29953-X","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. TTCSAES, Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-29953-X"},{"issue":"3","key":"50_CR15","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"RJ Fowler","year":"1981","unstructured":"Fowler, R.J., Paterson, M., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-Complete. Inf. Process. Lett. 12(3), 133\u2013137 (1981)","journal-title":"Inf. Process. Lett."},{"key":"50_CR16","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"issue":"6","key":"50_CR17","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0020-0190(93)90173-7","volume":"48","author":"O Goldschmidt","year":"1993","unstructured":"Goldschmidt, O., Hochbaum, D.S., Yu, G.: A modified greedy heuristic for the set covering problem with improved worst case bound. Inf. Process. Lett. 48(6), 305\u2013310 (1993)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"50_CR18","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s00224-020-10022-9","volume":"65","author":"A Jacob","year":"2021","unstructured":"Jacob, A., Majumdar, D., Raman, V.: Parameterized complexity of conflict free set cover. Theory Comput. Syst. 65(3), 515\u2013540 (2021). https:\/\/doi.org\/10.1007\/s00224-020-10022-9","journal-title":"Theory Comput. Syst."},{"issue":"6","key":"50_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). https:\/\/doi.org\/10.1007\/s00224-019-09964-6","journal-title":"Theory Comput. Syst."},{"key":"50_CR20","volume-title":"Algorithm Design","author":"JM Kleinberg","year":"2006","unstructured":"Kleinberg, J.M., Tardos, \u00c9.: Algorithm Design. Addison-Wesley, Boston (2006)"},{"key":"50_CR21","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"EL Lawler","year":"2001","unstructured":"Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Courier Corporation, Chelmsford (2001)"},{"issue":"6","key":"50_CR22","doi-asserted-by":"publisher","first-page":"1650","DOI":"10.1137\/14099317X","volume":"44","author":"NH Mustafa","year":"2015","unstructured":"Mustafa, N.H., Raman, R., Ray, S.: Quasi-polynomial time approximation scheme for weighted geometric set cover on pseudodisks and halfspaces. SIAM J. Comput. 44(6), 1650\u20131669 (2015)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pp. 216\u2013226. ACM (1978)","key":"50_CR23","DOI":"10.1145\/800133.804350"},{"issue":"1","key":"50_CR24","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s00453-013-9774-3","volume":"70","author":"R Van Bevern","year":"2014","unstructured":"Van Bevern, R.: Towards optimal and expressive kernelization for $$d$$-hitting set. Algorithmica 70(1), 129\u2013147 (2014). https:\/\/doi.org\/10.1007\/s00453-013-9774-3","journal-title":"Algorithmica"},{"key":"50_CR25","doi-asserted-by":"publisher","first-page":"105998","DOI":"10.1016\/j.ipl.2020.105998","volume":"163","author":"R van Bevern","year":"2020","unstructured":"van Bevern, R., Smirnov, P.V.: Optimal-size problem kernels for $$d$$-hitting set in linear time and space. Inf. Process. Lett. 163, 105998 (2020)","journal-title":"Inf. Process. Lett."},{"key":"50_CR26","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.dam.2021.03.014","volume":"298","author":"R van Bevern","year":"2021","unstructured":"van Bevern, R., Tsidulko, O.Y., Zschoche, P.: Representative families for matroid intersections, with applications to location, packing, and covering problems. Discrete Appl. Math. 298, 110\u2013128 (2021)","journal-title":"Discrete Appl. Math."},{"key":"50_CR27","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)"},{"issue":"1","key":"50_CR28","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0166-218X(96)00017-0","volume":"74","author":"H Yinnone","year":"1997","unstructured":"Yinnone, H.: On paths avoiding forbidden pairs of vertices in a graph. Discrete Appl. Math. 74(1), 85\u201392 (1997)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-89543-3_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T02:21:06Z","timestamp":1634782866000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89543-3_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030895426","9783030895433"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89543-3_50","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":"20 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tainan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"24 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2021\/","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":"131","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":"56","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":"43% - 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":"2.2","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)"}}]}}