{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:45:34Z","timestamp":1742978734421,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126906"},{"type":"electronic","value":"9783319126913"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-12691-3_4","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T21:11:32Z","timestamp":1415999492000},"page":"37-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimizing Squares Covering a Set of Points"],"prefix":"10.1007","author":[{"given":"Binay","family":"Bhattacharya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandip","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsunehiko","family":"Kameda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Priya Ranjan","family":"Sinha Mahapatra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhao","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF01182774","volume":"11","author":"PK Agarwal","year":"1994","unstructured":"Agarwal, P.K., Sharir, M.: Planar geometric locations problems. Algorithmica 11, 185\u2013195 (1994)","journal-title":"Algorithmica"},{"issue":"4","key":"4_CR2","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M Blum","year":"1973","unstructured":"Blum, M., Floyd, R., Pratt, V., Rivest, R., Tarjan, R.: Time bounds for selection. J. Comput. Syst. Sci. 7(4), 448\u2013461 (1973)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"4_CR3","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.comgeo.2007.10.001","volume":"40","author":"S Cabello","year":"2008","unstructured":"Cabello, S., D\u00edaz-B\u00e1\u00f1ez, J.M., Seara, C., Sellares, J.A., Urrutia, J., Ventura, I.: Covering point sets with two disjoint disks or squares. Comput. Geom. 40(3), 195\u2013206 (2008)","journal-title":"Comput. Geom."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1142\/S0218195992000123","volume":"2","author":"S Chandran","year":"1992","unstructured":"Chandran, S., Mount, D.: A parallel algorithm for enclosed and enclosing triangles. Int. J. Comput. Geom. Appl. 2, 191\u2013214 (1992)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"1","key":"4_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0377-2217(93)E0277-5","volume":"83","author":"N Christofides","year":"1995","unstructured":"Christofides, N., Hadjiconstantinou, E.: An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts. Eur. J. Oper. Res. 83(1), 21\u201338 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.ipl.2005.02.013","volume":"94","author":"S Das","year":"2005","unstructured":"Das, S., Goswami, P.P., Nandy, S.C.: Smallest $$k$$-point enclosing rectangle and square of arbitrary orientation. Inform. Process. Letts. 94, 259\u2013266 (2005)","journal-title":"Inform. Process. Letts."},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1115\/1.1375815","volume":"1","author":"CM Hoffmann","year":"2001","unstructured":"Hoffmann, C.M.: Robustness in geometric computations. J. Comput. Inf. Sci Eng. 1(2), 143\u2013155 (2001)","journal-title":"J. Comput. Inf. Sci Eng."},{"key":"4_CR8","unstructured":"Jaromczyk, J.W., Kowaluk, M.: Orientation independent covering of point sets $$R^{2}$$ with pairs of rectangles or optimal squares. In: Proceedings of the European Workshop on Computational Geometry. LNCS, vol. 871, pp. 71\u201378. Springer, Heidelberg (1996)"},{"issue":"4","key":"4_CR9","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0925-7721(99)00052-8","volume":"15","author":"MJ Katz","year":"2000","unstructured":"Katz, M.J., Kedem, K., Segal, M.: Discrete rectilinear 2-center problems. Comput. Geom. 15(4), 203\u2013214 (2000)","journal-title":"Comput. Geom."},{"issue":"3","key":"4_CR10","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1142\/S0218195911003676","volume":"21","author":"SS Kim","year":"2011","unstructured":"Kim, S.S., Bae, S.W., Ahn, H.K.: Covering a point set by two disjoint rectangles. Int. J. Comput. Geom. Appl. 21(3), 313\u2013330 (2011)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0196-6774(85)90005-7","volume":"6","author":"V Klee","year":"1985","unstructured":"Klee, V., Laskowski, M.: Finding the smallest triangles containing a given convex polygon. J. Algorithms 6, 359\u2013375 (1985)","journal-title":"J. Algorithms"},{"key":"4_CR12","unstructured":"Mahapatra, P.R.S., Goswami, P.P., Das, S.: Covering points by isothetic unit squares. In: Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp. 169\u2013172 (2007)"},{"key":"4_CR13","unstructured":"Mahapatra, P.R.S., Goswami, P.P., Das, S.: Maximal covering by two isothetic unit squares. In: Proceedings of the Canadian Conference on Computational Geometry (CCCG), pp. 103\u2013106 (2008)"},{"issue":"1","key":"4_CR14","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0020-0190(87)90086-X","volume":"25","author":"AA Melkman","year":"1987","unstructured":"Melkman, A.A.: On-line construction of the convex hull of a simple polyline. Inform. Process. Letts. 25(1), 11\u201312 (1987)","journal-title":"Inform. Process. Letts."},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF00991005","volume":"14","author":"J O\u2019Rourke","year":"1985","unstructured":"O\u2019Rourke, J.: Finding minimal enclosing boxes. Int. J. Comput. Inf. Sci. 14, 183\u2013199 (1985)","journal-title":"Int. J. Comput. Inf. Sci."},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/0196-6774(86)90007-6","volume":"7","author":"J O\u2019Rourke","year":"1986","unstructured":"O\u2019Rourke, J., Aggarwal, A., Maddila, S., Baldwin, M.: An optimal algorithm for finding minimal enclosing triangles. J. Algorithms 7, 258\u2013269 (1986)","journal-title":"J. Algorithms"},{"key":"4_CR17","volume-title":"Computational Geometry: An Introduction","author":"F Preparata","year":"1990","unstructured":"Preparata, F., Shamos, M.: Computational Geometry: An Introduction. Springer, Berlin (1990)"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1023\/A:1015670603203","volume":"1","author":"M Segal","year":"2002","unstructured":"Segal, M.: Lower bounds for covering problems. J. Math. Model. Algorithms 1, 17\u201329 (2002)","journal-title":"J. Math. Model. Algorithms"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Sharir, M., Welzl, E.: Rectilinear and polygonal $$p$$-piercing and $$p$$-center problems. In: ACM Symposium on Computational Geometry, pp. 122\u2013132 (1996)","DOI":"10.1145\/237218.237255"},{"key":"4_CR20","unstructured":"Toussaint, G.: Solving geometric problems with the rotating calipers. In: Proceedings of the IEEE MELECON (1983)"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BFb0038202","volume-title":"New Results and Trends in Computer Science","author":"E Welzl","year":"1991","unstructured":"Welzl, E.: Smallest enclosing disks (balls and ellipses). In: Maurer, H.A. (ed.) New Results and Trends in Computer Science. LNCS, vol. 555, pp. 359\u2013370. Springer, Heidelberg (1991)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12691-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T03:38:07Z","timestamp":1676000287000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12691-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126906","9783319126913"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12691-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"13 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}