{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:04:23Z","timestamp":1742936663755,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_23","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"246-258","source":"Crossref","is-referenced-by-count":6,"title":["Geometric Optimization Problems Over Sliding Windows"],"prefix":"10.1007","author":[{"given":"Timothy M.","family":"Chan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bashir S.","family":"Sadjad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, R.: Approximating extent measures of points. In: Journal of the ACM (to appear)"},{"key":"23_CR2","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0925-7721(92)90001-9","volume":"1","author":"P.K. Agarwal","year":"1991","unstructured":"Agarwal, P.K., Matou\u0161ek, J., Suri, S.: Farthest neighbors, maximum spanning trees and related problems in higher dimensions. Computational Geometry: Theory and Applications\u00a01, 189\u2013201 (1991)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BF02712871","volume":"16","author":"P.K. Agarwal","year":"1996","unstructured":"Agarwal, P.K., Sharir, M.: Efficient randomized algorithms for some geometric optimization problems. Discrete & Computational Geometry\u00a016, 317\u2013337 (1996)","journal-title":"Discrete & Computational Geometry"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/jagm.2000.1127","volume":"38","author":"G. Barequet","year":"2001","unstructured":"Barequet, G., Har-Peled, S.: Efficiently approximating the minimum-volume bounding box of a point set in three dimensions. Journal of Algorithms\u00a038, 91\u2013109 (2001)","journal-title":"Journal of Algorithms"},{"issue":"4","key":"23_CR5","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0196-6774(80)90015-2","volume":"1","author":"J.L. Bentley","year":"1980","unstructured":"Bentley, J.L., Saxe, J.B.: Decomposable searching problems I: Static-to-dynamic transformations. Journal of Algorithms\u00a01(4), 301\u2013358 (1980)","journal-title":"Journal of Algorithms"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1142\/S0218195902000748","volume":"12","author":"T.M. Chan","year":"2002","unstructured":"Chan, T.M.: Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus. International Journal on Computational Geometry and Applications\u00a012, 67\u201385 (2002)","journal-title":"International Journal on Computational Geometry and Applications"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: Faster core-set constructions and data stream algorithms in fixed dimensions. In: Proceedings of the 20th Annual Symposium on Computational Geometry, pp. 152\u2013159 (2004)","DOI":"10.1145\/997817.997843"},{"issue":"1","key":"23_CR8","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/BF02187740","volume":"4","author":"K.L. Clarkson","year":"1989","unstructured":"Clarkson, K.L., Shor, P.W.: Applications of random sampling in computational geometry, II. Discrete & Computational Geometry\u00a04(1), 387\u2013421 (1989)","journal-title":"Discrete & Computational Geometry"},{"key":"23_CR9","unstructured":"Duncan, C.A., Goodrich, M.T., Ramos, E.A.: Efficient approximation and optimization algorithms for computational metrology. In: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 121\u2013130 (1997)"},{"key":"23_CR10","unstructured":"Feigenbaum, J., Kannan, S., Zhang, J.: Computing diameter in the streaming and sliding-window models. Algorithmica, to appear; or as Tech. Report DCS\/TR-1245, Yale University (2002), \n                    http:\/\/cs-www.cs.yale.edu\/homes\/jf\/FKZ.ps"},{"key":"23_CR11","unstructured":"Goel, A., Indyk, P., Varadarajan, K.: Reductions among high dimensional proximity problems. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 769\u2013778 (2001)"},{"key":"23_CR12","unstructured":"Henzinger, M., Raghavan, P., Rajagopalan, S.: Computing on data streams. Technical Report SRC-TN-1998-011, Hewlett Packard Laboratories (1998)"},{"key":"23_CR13","unstructured":"Hershberger, J., Suri, S.: Convex hulls and related problems in data streams. In: ACM SIGMOD\/PODS Workshop on Management and Processing of Data Streams, pp. 148\u2013168 (2003)"},{"key":"23_CR14","unstructured":"Indyk, P.: Better algorithms for high-dimensional proximity problems via asymmetric embeddings. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 539\u2013545 (2003)"},{"key":"23_CR15","unstructured":"Muthukrishnan, S.M.: Data streams: Algorithms and applications. Rutgers University Technical Report (2003), \n                    http:\/\/athos.rutgers.edu\/~muthu\/stream-1-1.ps"},{"key":"23_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, Heidelberg (1985)"},{"key":"23_CR17","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s00454-001-0029-8","volume":"26","author":"E.A. Ramos","year":"2001","unstructured":"Ramos, E.A.: An optimal deterministic algorithm for computing the diameter of a three-dimensional point set. Discrete & Computational Geometry\u00a026, 233\u2013244 (2001)","journal-title":"Discrete & Computational Geometry"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T20:19:12Z","timestamp":1675196352000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}