{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T11:44:06Z","timestamp":1785930246365,"version":"3.56.0"},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819502141","type":"print"},{"value":"9789819502158","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-0215-8_20","type":"book-chapter","created":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T16:25:32Z","timestamp":1753979132000},"page":"262-276","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Membership Geometric Set Cover in\u00a0the\u00a0Continuous Setting"],"prefix":"10.1007","author":[{"given":"Sathish","family":"Govindarajan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mayuresh","family":"Patle","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Siddhartha","family":"Sarkar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,1]]},"reference":[{"key":"20_CR1","unstructured":"Aloupis, G., Hearn, R.A., Iwasawa, H., Uehara, R.: Covering points with disjoint unit disks. In: Canadian Conference on Computational Geometry (2012). https:\/\/api.semanticscholar.org\/CorpusID:16280099"},{"key":"20_CR2","unstructured":"Bandyapadhyay, S., Lochet, W., Saurabh, S., Xue, J.: Minimum-membership geometric set cover, revisited. In: International Symposium on Computational Geometry (2023)"},{"key":"20_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2020.101712","volume":"94","author":"T Biedl","year":"2021","unstructured":"Biedl, T., Biniaz, A., Lubiw, A.: Minimum ply covering of points with disks and squares. Comput. Geom. 94, 101712 (2021)","journal-title":"Comput. Geom."},{"key":"20_CR4","unstructured":"Biniaz, A., Lin, Z.: Minimum ply covering of points with convex shapes. In: Proceedings of the 32nd Canadian Conference on Computational Geometry, pp.\u00a02\u20135 (2020)"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Biniaz, A., Liu, P., Maheshwari, A., Smid, M.: Approximation algorithms for the unit disk cover problem in 2d and 3d. Computational Geometry 60, 8\u201318 (2017). the Twenty-Seventh Canadian Conference on Computational Geometry August 2015","DOI":"10.1016\/j.comgeo.2016.04.002"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Br\u00f6nnimann, H., Goodrich, M.: Almost optimal set covers in finite vc-dimension. Discr. Comput. Geometry 14(1), 463\u2013479 (1995). cited by: 392. All Open Access, Bronze Open Access","DOI":"10.1007\/BF02570718"},{"issue":"2","key":"20_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0925-7721(96)00019-3","volume":"10","author":"O Cheong","year":"1998","unstructured":"Cheong, O., Fuchs, U., Rote, G., Welzl, E.: Approximation of convex figures by pairs of rectangles. Comput. Geom. 10(2), 77\u201387 (1998)","journal-title":"Comput. Geom."},{"issue":"4","key":"20_CR8","doi-asserted-by":"publisher","first-page":"1464","DOI":"10.1137\/060656048","volume":"38","author":"ED Demaine","year":"2008","unstructured":"Demaine, E.D., Feige, U., Hajiaghayi, M., Salavatipour, M.R.: Combination can be hard: approximability of the unique coverage problem. SIAM J. Comput. 38(4), 1464\u20131483 (2008)","journal-title":"SIAM J. Comput."},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Durocher, S., Keil, J.M., Mondal, D.: Minimum ply covering of points with unit squares. In: WALCOM: Algorithms and Computation: 17th International Conference and Workshops. WALCOM 2023, Hsinchu, Taiwan, March 22\u201324, 2023, Proceedings, pp. 23\u201335. Springer-Verlag, Berlin, Heidelberg (2023)","DOI":"10.1007\/978-3-031-27051-2_3"},{"key":"20_CR10","unstructured":"Erlebach, T., van Leeuwen, E.J.: Approximating geometric coverage problems. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA \u201908. pp. 1267\u20131276. Society for Industrial and Applied Mathematics, USA (2008)"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Fu, B., Chen, Z., Abdelguerfi, M.: An almost linear time 2.8334-approximation algorithm for the disc covering problem. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). LNCS, vol. 4508, pp. 317\u2013326 (2007)","DOI":"10.1007\/978-3-540-72870-2_30"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-540-77537-9_13","volume-title":"Graph Drawing","author":"X Goaoc","year":"2008","unstructured":"Goaoc, X., Kratochv\u00edl, J., Okamoto, Y., Shin, C.S., Wolff, A.: Moving vertices to make drawings plane. In: Hong, S.H., Nishizeki, T., Quan, W. (eds.) Graph Drawing, pp. 101\u2013112. Springer, Heidelberg (2008)"},{"issue":"4","key":"20_CR13","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(91)90075-S","volume":"40","author":"TF Gonzalez","year":"1991","unstructured":"Gonzalez, T.F.: Covering a set of points in multidimensional space. Inf. Process. Lett. 40(4), 181\u2013188 (1991)","journal-title":"Inf. Process. Lett."},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-031-52213-0_8","volume-title":"Algorithms and Discrete Applied Mathematics","author":"S Govindarajan","year":"2024","unstructured":"Govindarajan, S., Sarkar, S.: Improved algorithms for minimum-membership geometric set cover. In: Kalyanasundaram, S., Maheshwari, A. (eds.) Algorithms and Discrete Applied Mathematics, pp. 103\u2013116. Springer, Cham (2024)"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and vlsi. J. ACM 32(1), 130\u2013136 (1985)","DOI":"10.1145\/2455.214106"},{"key":"20_CR16","volume-title":"Algorithm Design","author":"J Kleinberg","year":"2005","unstructured":"Kleinberg, J., Tardos, E.: Algorithm Design. Addison-Wesley Longman Publishing Co., Inc, USA (2005)"},{"issue":"3","key":"20_CR17","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. Discret. Math. 5(3), 422\u2013427 (1992)","journal-title":"SIAM J. Discret. Math."},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01263495","volume":"47","author":"M Lassak","year":"1993","unstructured":"Lassak, M.: Approximation of convex bodies by rectangles. Geom. Dedicata. 47, 111\u2013117 (1993). https:\/\/doi.org\/10.1007\/BF01263495","journal-title":"Geom. Dedicata."},{"key":"20_CR19","unstructured":"van Leeuwen, E.J.: Optimization and approximation on systems of geometric objects. Ph.D. thesis, University of Amsterdam (2009)"},{"issue":"2","key":"20_CR20","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput. 11(2), 329\u2013343 (1982)","journal-title":"SIAM J. Comput."}],"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-981-95-0215-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T10:49:05Z","timestamp":1785926945000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-0215-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,1]]},"ISBN":["9789819502141","9789819502158"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-0215-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,1]]},"assertion":[{"value":"1 August 2025","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":"Chengdu","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","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":"cocoon0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/cocoon2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}