{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:38:27Z","timestamp":1742956707141,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_44","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T15:12:41Z","timestamp":1435072361000},"page":"559-571","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Linear Time Approximation Schemes for Geometric Maximum Coverage"],"prefix":"10.1007","author":[{"given":"Jian","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haitao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bowei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ningye","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"44_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/3-540-45749-6_8","volume-title":"Algorithms - ESA 2002","author":"PK Agarwal","year":"2002","unstructured":"Agarwal, P.K., Hagerup, T., Ray, R., Sharir, M., Smid, M., Welzl, E.: Translating a planar object to maximize point containment. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, p. 42. Springer, Heidelberg (2002)"},{"issue":"3","key":"44_CR2","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1137\/060669474","volume":"38","author":"B Aronov","year":"2008","unstructured":"Aronov, B., Har-Peled, S.: On approximating the depth and related problems. SICOMP 38(3), 899\u2013921 (2008)","journal-title":"SICOMP"},{"issue":"4","key":"44_CR3","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0925-7721(96)00011-9","volume":"8","author":"G Barequet","year":"1997","unstructured":"Barequet, G., Dickerson, M., Pau, P.: Translating a convex polygon to contain a maximum number of points. Computational Geometry 8(4), 167\u2013179 (1997)","journal-title":"Computational Geometry"},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Lower bounds for algebraic computation trees. In: STOC, pp. 80\u201386. ACM (1983)","DOI":"10.1145\/800061.808735"},{"key":"44_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/11841036_17","volume-title":"Algorithms \u2013 ESA 2006","author":"D Bremner","year":"2006","unstructured":"Bremner, D., Chan, T.M., Demaine, E.D., Erickson, J., Hurtado, F., Iacono, J., Langerman, S., Taslakian, P.: Necklaces, convolutions, and X + Y. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 160\u2013171. Springer, Heidelberg (2006)"},{"issue":"1","key":"44_CR6","first-page":"463","volume":"14","author":"H Br\u00f6nnimann","year":"1995","unstructured":"Br\u00f6nnimann, H., Goodrich, M.: Almost optimal set covers in finite vc-dimension. DCG 14(1), 463\u2013479 (1995)","journal-title":"DCG"},{"issue":"3","key":"44_CR7","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. Computational Geometry 40(3), 195\u2013206 (2008)","journal-title":"Computational Geometry"},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"Chan, T.M., Grant, E., K\u00f6nemann, J., Sharpe, M.: Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling. In: SODA, SODA 2012, pp. 1576\u20131585. SIAM (2012)","DOI":"10.1137\/1.9781611973099.125"},{"issue":"1\u20132","key":"44_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02238188","volume":"36","author":"BM Chazelle","year":"1986","unstructured":"Chazelle, B.M., Lee, D.-T.: On a circle placement problem. Computing 36(1\u20132), 1\u201316 (1986)","journal-title":"Computing"},{"issue":"1","key":"44_CR10","first-page":"43","volume":"37","author":"KL Clarkson","year":"2007","unstructured":"Clarkson, K.L., Varadarajan, K.: Improved approximation algorithms for geometric set cover. DCG 37(1), 43\u201358 (2007)","journal-title":"DCG"},{"key":"44_CR11","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press (2009)"},{"issue":"3","key":"44_CR12","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/s00224-008-9135-9","volume":"45","author":"M de Berg","year":"2009","unstructured":"de Berg, M., Cabello, S., Har-Peled, S.: Covering many or few points with unit disks. Theory of Computing Systems 45(3), 446\u2013469 (2009)","journal-title":"Theory of Computing Systems"},{"issue":"1","key":"44_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0925-7721(98)00015-7","volume":"11","author":"M Dickerson","year":"1998","unstructured":"Dickerson, M., Scharstein, D.: Optimal placement of convex polygons to maximize point containment. Computational Geometry 11(1), 1\u201316 (1998)","journal-title":"Computational Geometry"},{"issue":"1","key":"44_CR14","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1006\/jagm.1997.0873","volume":"25","author":"M Dietzfelbinger","year":"1997","unstructured":"Dietzfelbinger, M., Hagerup, T., Katajainen, J., Penttonen, M.: A reliable randomized algorithm for the closest-pair problem. Journal of Algorithms 25(1), 19\u201351 (1997)","journal-title":"Journal of Algorithms"},{"issue":"7","key":"44_CR15","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1287\/mnsc.27.7.848","volume":"27","author":"Z Drezner","year":"1981","unstructured":"Drezner, Z.: Noteon a modified one-center model. Management Science 27(7), 848\u2013851 (1981)","journal-title":"Management Science"},{"issue":"2","key":"44_CR16","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/j.ipl.2005.03.010","volume":"95","author":"G Even","year":"2005","unstructured":"Even, G., Rawitz, D., Shahar, S.M.: Hitting sets when the vc-dimension is small. IPL 95(2), 358\u2013362 (2005)","journal-title":"IPL"},{"issue":"4","key":"44_CR17","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. JACM 45(4), 634\u2013652 (1998)","journal-title":"JACM"},{"issue":"4","key":"44_CR18","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","volume":"1","author":"RL Graham","year":"1972","unstructured":"Graham, R.L.: An efficient algorith for determining the convex hull of a finite planar set. Information processing letters 1(4), 132\u2013133 (1972)","journal-title":"Information processing letters"},{"issue":"1","key":"44_CR19","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. JACM 32(1), 130\u2013136 (1985)","journal-title":"JACM"},{"issue":"6","key":"44_CR20","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1002\/(SICI)1520-6750(199809)45:6<615::AID-NAV5>3.0.CO;2-5","volume":"45","author":"DS Hochbaum","year":"1998","unstructured":"Hochbaum, D.S., Pathria, A.: Analysis of the greedy approach in problems of maximum k-coverage. Naval Research Logistics 45(6), 615\u2013627 (1998)","journal-title":"Naval Research Logistics"},{"issue":"4","key":"44_CR21","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/0196-6774(83)90012-3","volume":"4","author":"H Imai","year":"1983","unstructured":"Imai, H., Asano, T.: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane. Journal of algorithms 4(4), 310\u2013323 (1983)","journal-title":"Journal of algorithms"},{"issue":"1","key":"44_CR22","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1137\/0213014","volume":"13","author":"N Megiddo","year":"1984","unstructured":"Megiddo, N., Supowit, K.J.: On the complexity of some common geometric location problems. SICOMP 13(1), 182\u2013196 (1984)","journal-title":"SICOMP"},{"key":"44_CR23","doi-asserted-by":"crossref","unstructured":"Mustafa, N.H., Ray, S.: Ptas for geometric hitting set problems via local search. In: SCG, pp. 17\u201322. ACM (2009)","DOI":"10.1145\/1542362.1542367"},{"issue":"8","key":"44_CR24","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0898-1221(95)00029-X","volume":"29","author":"SC Nandy","year":"1995","unstructured":"Nandy, S.C., Bhattacharya, B.B.: A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids. Computers & Mathematics with Applications 29(8), 45\u201361 (1995)","journal-title":"Computers & Mathematics with Applications"},{"issue":"1","key":"44_CR25","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions. Mathematical Programming 14(1), 265\u2013294 (1978)","journal-title":"Mathematical Programming"},{"issue":"13","key":"44_CR26","doi-asserted-by":"publisher","first-page":"1546","DOI":"10.14778\/2536258.2536266","volume":"6","author":"Y Tao","year":"2013","unstructured":"Tao, Y., Hu, X., Choi, D.-W., Chung, C.-W.: Approximate maxrs in spatial databases. Proceedings of the VLDB Endowment 6(13), 1546\u20131557 (2013)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"44_CR27","doi-asserted-by":"crossref","unstructured":"Varadarajan, K.: Weighted geometric set cover via quasi-uniform sampling. In: STOC, pp. 641\u2013648. ACM (2010)","DOI":"10.1145\/1806689.1806777"},{"key":"44_CR28","doi-asserted-by":"crossref","unstructured":"Williams, R.: Faster all-pairs shortest paths via circuit complexity. In: STOC, pp. 664\u2013673. ACM (2014)","DOI":"10.1145\/2591796.2591811"}],"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-21398-9_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T02:27:27Z","timestamp":1676946447000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}