{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:53:18Z","timestamp":1742971998013,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319171418"},{"type":"electronic","value":"9783319171425"}],"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-17142-5_17","type":"book-chapter","created":{"date-parts":[[2015,4,15]],"date-time":"2015-04-15T11:19:29Z","timestamp":1429096769000},"page":"189-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls"],"prefix":"10.1007","author":[{"given":"Wanbin","family":"Son","sequence":"first","affiliation":[]},{"given":"Peyman","family":"Afshani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,16]]},"reference":[{"issue":"5","key":"17_CR1","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1007\/s11590-012-0483-7","volume":"7","author":"B Mordukhovich","year":"2013","unstructured":"Mordukhovich, B., Nam, N., Villalobos, C.: The smallest enclosing ball problem and the smallest intersecting ball problem: existence and uniqueness of solutions. Optim. Lett. 7(5), 839\u2013853 (2013)","journal-title":"Optim. Lett."},{"issue":"4","key":"17_CR2","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.comgeo.2009.03.007","volume":"43","author":"M L\u00f6ffler","year":"2010","unstructured":"L\u00f6ffler, M., van Kreveld, M.: Largest bounding box, smallest diameter, and related problems on imprecise points. Comput. Geom. 43(4), 419\u2013433 (2010)","journal-title":"Comput. Geom."},{"issue":"4\u20135","key":"17_CR3","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/BF01940877","volume":"16","author":"J Matou\u0161ek","year":"1996","unstructured":"Matou\u0161ek, J., Sharir, M., Welzl, E.: A subexponential bound for linear programming. Algorithmica 16(4\u20135), 498\u2013516 (1996)","journal-title":"Algorithmica"},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/j.comgeo.2012.09.002","volume":"46","author":"HK Ahn","year":"2013","unstructured":"Ahn, H.K., Kim, S.S., Knauer, C., Schlipf, L., Shin, C.S., Vigneron, A.: Covering and piercing disks with two centers. Comput. Geom. 46(3), 253\u2013262 (2013)","journal-title":"Comput. Geom."},{"key":"17_CR5","unstructured":"Zarrabi-Zadeh, H., Chan, T.: A simple streaming algorithm for minimum enclosing balls. In: Proceedings of the 18th Canadian Conference on Computational Geometry, pp. 139\u2013142 (2006)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Sharathkumar, R.: Streaming algorithms for extent problems in high dimensions. In: Proceedings of the 21st ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, pp. 1481\u20131489 (2010)","DOI":"10.1137\/1.9781611973075.120"},{"issue":"2, Part B","key":"17_CR7","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.comgeo.2013.05.007","volume":"47","author":"TM Chan","year":"2014","unstructured":"Chan, T.M., Pathak, V.: Streaming and dynamic algorithms for minimum enclosing balls in high dimensions. Comput. Geom. 47(2, Part B), 240\u2013247 (2014)","journal-title":"Comput. Geom."},{"key":"17_CR8","unstructured":"B\u00e2doiu, M., Clarkson, K.L.: Smaller core-sets for balls. In: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms, SODA 2003, pp. 801\u2013802 (2003)"},{"key":"17_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"issue":"3","key":"17_CR10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0925-7721(99)00019-X","volume":"13","author":"T Chan","year":"1999","unstructured":"Chan, T.: More planar two-center algorithms. Comput. Geom. 13(3), 189\u2013198 (1999)","journal-title":"Comput. Geom."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Agarwal, P., Avraham, R., Sharir, M.: The 2-center problem in three dimensions. In: Proceedings of the 26th ACM Symposium Computational Geometry, pp. 87\u201396 (2010)","DOI":"10.1145\/1810959.1810974"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T Gonzalez","year":"1985","unstructured":"Gonzalez, T.: Clustering to minimize the maximum intercluster distance. Theoret. Comput. Sci. 38, 293\u2013306 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Feder, D., Greene, D.: Optimal algorithms for approximate clustering. In: Proceedings of the 20th ACM Symposium on Theory of Computing, pp. 434\u2013444 (1988)","DOI":"10.1145\/62212.62255"},{"issue":"6","key":"17_CR14","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1137\/S0097539702418498","volume":"33","author":"M Charikar","year":"2004","unstructured":"Charikar, M., Chekuri, C., Feder, T., Motwani, R.: Incremental clustering and dynamic information retrieval. SIAM J. Comput. 33(6), 1417\u20131440 (2004)","journal-title":"SIAM J. Comput."},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Guha, S.: Tight results for clustering and summarizing data streams. In: Proceedings of the 12th International Conference on Database Theory, pp. 268\u2013275 (2009)","DOI":"10.1145\/1514894.1514926"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-540-85363-3_14","volume-title":"Approximation, Randomization and Combinatorial Optimization","author":"R Matthew McCutchen","year":"2008","unstructured":"Matthew McCutchen, R., Khuller, S.: Streaming algorithms for k-center clustering with outliers and with anonymity. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX and RANDOM 2008. LNCS, vol. 5171, pp. 165\u2013178. Springer, Heidelberg (2008)"},{"issue":"12","key":"17_CR17","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.comgeo.2005.10.002","volume":"35","author":"TM Chan","year":"2006","unstructured":"Chan, T.M.: Faster core-set constructions and data-stream algorithms in fixed dimensions. Comput. Geom. 35(12), 20\u201335 (2006)","journal-title":"Comput. Geom."},{"issue":"3","key":"17_CR18","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1006\/jagm.1996.0060","volume":"21","author":"B Chazelle","year":"1996","unstructured":"Chazelle, B., Matou\u0161ek, J.: On linear-time deterministic algorithms for optimization problems in fixed dimension. J. Algorithms 21(3), 579\u2013597 (1996)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17142-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T07:01:12Z","timestamp":1674198072000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17142-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319171418","9783319171425"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17142-5_17","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":"16 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}