{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:55:03Z","timestamp":1743094503706,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319947754"},{"type":"electronic","value":"9783319947761"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-94776-1_16","type":"book-chapter","created":{"date-parts":[[2018,6,29]],"date-time":"2018-06-29T01:48:06Z","timestamp":1530236886000},"page":"180-191","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing Coverage Kernels Under Restricted Settings"],"prefix":"10.1007","author":[{"given":"J\u00e9r\u00e9my","family":"Barbay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pablo","family":"P\u00e9rez-Lantero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javiel","family":"Rojas-Ledesma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,29]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Pan, J.: Near-linear algorithms for geometric hitting sets and set covers. In: Proceedings of the 30th Annual Symposium on Computational Geometry (SoCG), pp. 271:271\u2013271:279. ACM, New York (2014)","DOI":"10.1145\/2582112.2582152"},{"issue":"1\u20132","key":"16_CR2","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.tcs.2007.09.013","volume":"389","author":"VE Alekseev","year":"2007","unstructured":"Alekseev, V.E., Boliac, R., Korobitsyn, D.V., Lozin, V.V.: NP-hard graph problems and boundary classes of graphs. Theor. Comput. Sci. (TCS) 389(1\u20132), 219\u2013236 (2007)","journal-title":"Theor. Comput. Sci. (TCS)"},{"issue":"7","key":"16_CR3","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 $$\\varepsilon $$-nets for axis-parallel rectangles and boxes. SIAM J. Comput. (SICOMP) 39(7), 3248\u20133282 (2010)","journal-title":"SIAM J. Comput. (SICOMP)"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Barbay, J., P\u00e9rez-Lantero, P., Rojas-Ledesma, J.: Computing coverage kernels under restricted settings. arXiv e-prints (2018)","DOI":"10.1007\/978-3-319-94776-1_16"},{"issue":"4","key":"16_CR5","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. (DCG) 14(4), 463\u2013479 (1995)","journal-title":"Discrete Comput. Geom. (DCG)"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: Klee\u2019s measure problem made easy. In: 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS), Berkeley, CA, USA, 26\u201329 October 2013. IEEE Computer Society, pp. 410\u2013419 (2013)","DOI":"10.1109\/FOCS.2013.51"},{"issue":"1","key":"16_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. (DCG) 37(1), 43\u201358 (2007)","journal-title":"Discrete Comput. Geom. (DCG)"},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jagm.1994.1025","volume":"17","author":"JC Culberson","year":"1994","unstructured":"Culberson, J.C., Reckhow, R.A.: Covering polygons is hard. J. Algorithms (JALG) 17(1), 2\u201344 (1994)","journal-title":"J. Algorithms (JALG)"},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1109\/TNET.2015.2397393","volume":"24","author":"J Daly","year":"2016","unstructured":"Daly, J., Liu, A.X., Torng, E.: A difference resolution approach to compressing access control lists. IEEE\/ACM Trans. Netw. (TON) 24(1), 610\u2013623 (2016)","journal-title":"IEEE\/ACM Trans. Netw. (TON)"},{"key":"16_CR10","series-title":"Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999). https:\/\/doi.org\/10.1007\/978-1-4612-0515-9"},{"issue":"3","key":"16_CR11","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. (IPL) 12(3), 133\u2013137 (1981)","journal-title":"Inf. Process. Lett. (IPL)"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF02187876","volume":"2","author":"D Haussler","year":"1987","unstructured":"Haussler, D., Welzl, E.: $$\\varepsilon $$-nets and simplex range queries. Discrete Comput. Geom. 2, 127\u2013151 (1987)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"16_CR13","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1137\/0405033","volume":"5","author":"DE Knuth","year":"1992","unstructured":"Knuth, D.E., Raghunathan, A.: The problem of compatible representatives. SIAM J. Discrete Math. 5(3), 422\u2013427 (1992)","journal-title":"SIAM J. Discrete Math."},{"issue":"6","key":"16_CR14","doi-asserted-by":"publisher","first-page":"1509","DOI":"10.1137\/S0097539799358835","volume":"32","author":"VSA Kumar","year":"2003","unstructured":"Kumar, V.S.A., Ramesh, H.: Covering rectilinear polygons with axis-parallel rectangles. SIAM J. Comput. (SICOMP) 32(6), 1509\u20131541 (2003)","journal-title":"SIAM J. Comput. (SICOMP)"},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1016\/B978-155860869-6\/50073-1","volume-title":"VLDB '02: Proceedings of the 28th International Conference on Very Large Databases","author":"Laks V.S. Lakshmanan","year":"2002","unstructured":"Lakshmanan, L.V.S., Ng, R.T., Wang, C.X., Zhou, X., Johnson, T.: The generalized MDL approach for summarization. In: Proceedings of 28th International Conference on Very Large Data Bases (VLDB), Hong Kong, China, 20\u201323 August 2002, pp. 766\u2013777. Morgan Kaufmann (2002)"},{"issue":"4","key":"16_CR16","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers. Discrete Math. (DM) 13(4), 383\u2013390 (1975)","journal-title":"Discrete Math. (DM)"},{"issue":"2","key":"16_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1346330.1346336","volume":"55","author":"W Mulzer","year":"2008","unstructured":"Mulzer, W., Rote, G.: Minimum-weight triangulation is NP-hard. J. ACM (JACM) 55(2), 1\u201329 (2008)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"16_CR18","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1145\/1061318.1061324","volume":"30","author":"KQ Pu","year":"2005","unstructured":"Pu, K.Q., Mendelzon, A.O.: Concise descriptions of subsets of structured sets. ACM Trans. Database Syst. (TODS) 30(1), 211\u2013248 (2005)","journal-title":"ACM Trans. Database Syst. (TODS)"}],"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-319-94776-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:34:31Z","timestamp":1710347671000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94776-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319947754","9783319947761"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94776-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 June 2018","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":"Qing Dao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon2018.sdu.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}