{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:20:47Z","timestamp":1743121247529,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319623887"},{"type":"electronic","value":"9783319623894"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-62389-4_3","type":"book-chapter","created":{"date-parts":[[2017,6,30]],"date-time":"2017-06-30T15:07:46Z","timestamp":1498835266000},"page":"25-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Local Search Strikes Again: PTAS for Variants of Geometric Covering and Packing"],"prefix":"10.1007","author":[{"given":"Pradeesha","family":"Ashok","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aniket","family":"Basu Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sathish","family":"Govindarajan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,1]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Pach, J., Sharir, M.: State of the union (of geometric objects): a review (2007)","DOI":"10.1090\/conm\/453\/08794"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-36065-7_10","volume-title":"WALCOM: Algorithms and Computation","author":"R Aschner","year":"2013","unstructured":"Aschner, R., Katz, M.J., Morgenstern, G., Yuditsky, Y.: Approximation schemes for covering and packing. In: Ghosh, S.K., Tokuyama, T. (eds.) WALCOM 2013. LNCS, vol. 7748, pp. 89\u2013100. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-36065-7_10"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1007\/978-3-319-21398-9_43","volume-title":"Computing and Combinatorics","author":"P Ashok","year":"2015","unstructured":"Ashok, P., Kolay, S., Misra, N., Saurabh, S.: Unique covering problems with geometric sets. In: Xu, D., Du, D., Du, D. (eds.) COCOON 2015. LNCS, vol. 9198, pp. 548\u2013558. Springer, Cham (2015). doi:10.1007\/978-3-319-21398-9_43"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Bandyapadhyay, S., Basu Roy, A.: Effectiveness of local search for art gallery problems. In: WADS (2017)","DOI":"10.1007\/978-3-319-62127-2_5"},{"issue":"1","key":"3_CR5","first-page":"221","volume":"7","author":"N Bansal","year":"2016","unstructured":"Bansal, N., Pruhs, K.: Weighted geometric set multi-cover via quasi-uniform sampling. JoCG 7(1), 221\u2013236 (2016)","journal-title":"JoCG"},{"issue":"2","key":"3_CR6","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s00454-012-9417-5","volume":"48","author":"TM Chan","year":"2012","unstructured":"Chan, T.M., Har-Peled, S.: Approximation algorithms for maximum independent set of pseudo-disks. Discrete Comput. Geom. 48(2), 373\u2013392 (2012)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"3_CR7","first-page":"9","volume":"9","author":"C Chekuri","year":"2012","unstructured":"Chekuri, C., Clarkson, K.L., Har-Peled, S.: On the set multicover problem in geometric settings. ACM Trans. Algorithms (TALG) 9(1), 9 (2012)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Cohen-Addad, V., Klein, P.N., Mathieu, C.: Local search yields approximation schemes for k-means and k-median in euclidean and minor-free metrics. In: FOCS, pp. 353\u2013364 (2016)","DOI":"10.1109\/FOCS.2016.46"},{"key":"3_CR9","unstructured":"Cohen-Addad, V., Mathieu, C.: Effectiveness of local search for geometric optimization. In: SoCG, pp. 329\u2013343 (2015)"},{"issue":"2\u20133","key":"3_CR10","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.tcs.2004.02.035","volume":"320","author":"V Dahll\u00f6f","year":"2004","unstructured":"Dahll\u00f6f, V., Jonsson, P., Beigel, R.: Algorithms for four variants of the exact satisfiability problem. Theor. Comput. Sci. 320(2\u20133), 373\u2013394 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"3_CR11","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":"3_CR12","doi-asserted-by":"crossref","unstructured":"Ene, A., Har-Peled, S., Raichel, B.: Geometric packing under non-uniform constraints. In: SoCG, pp. 11\u201320 (2012)","DOI":"10.1145\/2261250.2261253"},{"key":"3_CR13","unstructured":"Erlebach, T., Van Leeuwen, E.J.: Approximating geometric coverage problems. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1267\u20131276. Society for Industrial and Applied Mathematics (2008)"},{"issue":"3","key":"3_CR14","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)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"3_CR15","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1137\/0216064","volume":"16","author":"GN Frederickson","year":"1987","unstructured":"Frederickson, G.N.: Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comput. 16(6), 1004\u20131022 (1987)","journal-title":"SIAM J. Comput."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Friggstad, Z., Rezapour, M., Salavatipour, M.R.: Local search yields a PTAS for k-means in doubling metrics. In: FOCS, pp. 365\u2013374 (2016)","DOI":"10.1109\/FOCS.2016.47"},{"key":"3_CR17","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability (1979)"},{"key":"3_CR18","unstructured":"Govindarajan, S., Raman, R., Ray, S., Basu Roy, A.: Packing and covering with non-piercing regions. In: ESA, pp. 47:1\u201347:17 (2016)"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Har-Peled, S.: Quasi-polynomial time approximation scheme for sparse subsets of polygons. In: SoCG, pp. 120:120\u2013120:129 (2014)","DOI":"10.1145\/2582112.2582157"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.tcs.2014.04.014","volume":"544","author":"T Ito","year":"2014","unstructured":"Ito, T., Nakano, S., Okamoto, Y., Otachi, Y., Uehara, R., Uno, T., Uno, Y.: A 4.31-approximation for the geometric unique coverage problem on unit disks. Theor. Comput. Sci. 544, 14\u201331 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-31155-0_3","volume-title":"Algorithm Theory \u2013 SWAT 2012","author":"T Ito","year":"2012","unstructured":"Ito, T., Nakano, S.-I., Okamoto, Y., Otachi, Y., Uehara, R., Uno, T., Uno, Y.: A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol. 7357, pp. 24\u201335. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-31155-0_3"},{"issue":"1","key":"3_CR22","first-page":"168","volume":"5","author":"E Krohn","year":"2014","unstructured":"Krohn, E., Gibson, M., Kanade, G., Varadarajan, K.: Guarding terrains via local search. J. Comput. Geom. 5(1), 168\u2013178 (2014)","journal-title":"J. Comput. Geom."},{"key":"3_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Springer, New York (2002)"},{"issue":"3","key":"3_CR24","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s00453-011-9608-0","volume":"65","author":"N Misra","year":"2013","unstructured":"Misra, N., Moser, H., Raman, V., Saurabh, S., Sikdar, S.: The parameterized complexity of unique coverage and its variants. Algorithmica 65(3), 517\u2013544 (2013)","journal-title":"Algorithmica"},{"issue":"4","key":"3_CR25","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. Discrete Comput. Geom. 44(4), 883\u2013895 (2010)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"3_CR26","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1017\/S0963548315000280","volume":"25","author":"J Pach","year":"2016","unstructured":"Pach, J., Walczak, B.: Decomposition of multiple packings with subquadratic union complexity. Comb. Probab. Comput. 25(1), 145\u2013153 (2016)","journal-title":"Comb. Probab. Comput."},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Pyrga, E., Ray, S.: New existence proofs for $$\\epsilon $$-nets. In: SoCG, pp. 199\u2013207 (2008)","DOI":"10.1145\/1377676.1377708"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, pp. 216\u2013226. ACM (1978)","DOI":"10.1145\/800133.804350"},{"key":"3_CR29","unstructured":"Whitesides, S., Zhao, R.: K-admissible collections of jordan curves and offsets of circular arc figures. Technical report, McGill University, School of Computer Science (1990)"}],"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-62389-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:22:57Z","timestamp":1709810577000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62389-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319623887","9783319623894"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62389-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"1 July 2017","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":"Hong Kong","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":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 August 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon2017.comp.polyu.edu.hk\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}