{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T22:41:23Z","timestamp":1785969683182,"version":"3.56.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031522123","type":"print"},{"value":"9783031522130","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-52213-0_8","type":"book-chapter","created":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T10:02:29Z","timestamp":1705140149000},"page":"103-116","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved Algorithms for\u00a0Minimum-Membership Geometric Set Cover"],"prefix":"10.1007","author":[{"given":"Sathish","family":"Govindarajan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Siddhartha","family":"Sarkar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,1,14]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Agarwal, P.K., Pan, J.: Near-linear algorithms for geometric hitting sets and set covers. In: Proceedings of the Thirtieth Annual Symposium on Computational Geometry, SOCG 2014, pp. 271\u2013279. Association for Computing Machinery, New York (2014). https:\/\/doi.org\/10.1145\/2582112.2582152","DOI":"10.1145\/2582112.2582152"},{"issue":"1","key":"8_CR2","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10107-018-1244-x","volume":"175","author":"Z Allen-Zhu","year":"2019","unstructured":"Allen-Zhu, Z., Orecchia, L.: Nearly linear-time packing and covering LP solvers. Math. Program. 175(1), 307\u2013353 (2019). https:\/\/doi.org\/10.1007\/s10107-018-1244-x","journal-title":"Math. Program."},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Bandyapadhyay, S., Lochet, W., Saurabh, S., Xue, J.: Minimum-membership geometric set cover, revisited. In: 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol. 258, pp. 11:1\u201311:14 (2023). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2023.11","DOI":"10.4230\/LIPIcs.SoCG.2023.11"},{"key":"8_CR4","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). https:\/\/doi.org\/10.1016\/j.comgeo.2020.101712","journal-title":"Comput. Geom."},{"key":"8_CR5","doi-asserted-by":"publisher","unstructured":"Chan, T.M., Grant, E.: Exact algorithms and APX-hardness results for geometric packing and covering problems. Comput. Geom. 47(2, Part A), 112\u2013124 (2014). https:\/\/doi.org\/10.1016\/j.comgeo.2012.04.001. Special Issue: 23rd Canadian Conference on Computational Geometry (CCCG11)","DOI":"10.1016\/j.comgeo.2012.04.001"},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Chan, T.M., Hu, N.: Geometric red-blue set cover for unit squares and related problems. Comput. Geom. 48(5), 380\u2013385 (2015). https:\/\/doi.org\/10.1016\/j.comgeo.2014.12.005. Special Issue on the 25th Canadian Conference on Computational Geometry (CCCG)","DOI":"10.1016\/j.comgeo.2014.12.005"},{"issue":"1","key":"8_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.: Improved approximation algorithms for geometric set cover. Discret. Comput. Geom. 37(1), 43\u201358 (2007). https:\/\/doi.org\/10.1007\/s00454-006-1273-8","journal-title":"Discret. Comput. Geom."},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-031-27051-2_3","volume-title":"WALCOM Algorithms and Computation","author":"S Durocher","year":"2023","unstructured":"Durocher, S., Keil, J.M., Mondal, D.: Minimum ply covering of points with unit squares. In: Lin, C.C., Lin, B.M.T., Liotta, G. (eds.) WALCOM 2023. LNCS, vol. 13973, pp. 23\u201335. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-27051-2_3"},{"key":"8_CR9","unstructured":"Erlebach, T., van Leeuwen, E.J.: Approximating geometric coverage problems. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, pp. 1267\u20131276. Society for Industrial and Applied Mathematics (2008)"},{"issue":"4","key":"8_CR10","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). https:\/\/doi.org\/10.1145\/285055.285059","journal-title":"J. ACM"},{"issue":"3","key":"8_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.S., Tanimoto, S.L.: Optimal packing and covering in the plane are np-complete. Inf. Process. Lett. 12(3), 133\u2013137 (1981). https:\/\/doi.org\/10.1016\/0020-0190(81)90111-3","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"8_CR12","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"DS Hochbaum","year":"1985","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). https:\/\/doi.org\/10.1145\/2455.214106","journal-title":"J. ACM"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.comgeo.2015.10.004","volume":"51","author":"T Ito","year":"2016","unstructured":"Ito, T., et al.: A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares. Comput. Geom. 51, 25\u201339 (2016)","journal-title":"Comput. Geom."},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/11533719_21","volume-title":"Computing and Combinatorics","author":"F Kuhn","year":"2005","unstructured":"Kuhn, F., von Rickenbach, P., Wattenhofer, R., Welzl, E., Zollinger, A.: Interference in cellular networks: the minimum membership set cover problem. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 188\u2013198. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11533719_21"},{"key":"8_CR15","doi-asserted-by":"publisher","unstructured":"Mustafa, N.H., Raman, R., Ray, S.: Settling the APX-hardness status for geometric set cover. In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, 18\u201321 October 2014, pp. 541\u2013550. IEEE Computer Society (2014). https:\/\/doi.org\/10.1109\/FOCS.2014.64","DOI":"10.1109\/FOCS.2014.64"},{"issue":"4","key":"8_CR16","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1007\/s00454-010-9285-9","volume":"44","author":"NH Mustafa","year":"2010","unstructured":"Mustafa, N.H., Ray, S.: Improved results on geometric hitting set problems. Discret. Comput. Geom. 44(4), 883\u2013895 (2010). https:\/\/doi.org\/10.1007\/s00454-010-9285-9","journal-title":"Discret. Comput. Geom."},{"key":"8_CR17","doi-asserted-by":"publisher","unstructured":"Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, STOC 1997, pp. 475\u2013484. Association for Computing Machinery, New York (1997). https:\/\/doi.org\/10.1145\/258533.258641","DOI":"10.1145\/258533.258641"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-52213-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:22:21Z","timestamp":1768281741000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52213-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031522123","9783031522130"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52213-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"14 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhilai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.iitbhilai.ac.in\/caldam2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}