{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:22Z","timestamp":1725456982878},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642352607"},{"type":"electronic","value":"9783642352614"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35261-4_9","type":"book-chapter","created":{"date-parts":[[2012,12,14]],"date-time":"2012-12-14T01:59:41Z","timestamp":1355450381000},"page":"54-63","source":"Crossref","is-referenced-by-count":0,"title":["Computing k-center over Streaming Data for Small k"],"prefix":"10.1007","author":[{"given":"Hee-Kap","family":"Ahn","sequence":"first","affiliation":[]},{"given":"Hyo-Sil","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Sang-Sub","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Wanbin","family":"Son","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"9_CR1","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1145\/1008731.1008736","volume":"51","author":"P.K. Agarwal","year":"2004","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measures of points. Journal of the ACM\u00a051(4), 606\u2013635 (2004)","journal-title":"Journal of the ACM"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s00453-001-0110-y","volume":"33","author":"P.K. Agarwal","year":"2002","unstructured":"Agarwal, P.K., Procopiuc, C.M.: Exact and approximation algorithms for clustering. Algorithmica\u00a033, 201\u2013226 (2002)","journal-title":"Algorithmica"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Sharathkumar, R.: Streaming algorithms for extent problems in high dimensions. In: Proc.\u00a0of the 21st ACM-SIAM Sympos. Discrete Algorithms, pp. 1481\u20131489 (2010)","DOI":"10.1137\/1.9781611973075.120"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C.: Data streams: models and algorithms. Springer (2007)","DOI":"10.1007\/978-0-387-47534-9"},{"key":"9_CR5","unstructured":"Bern, M., Eppstein, D.: Approximation algorithms for geometric problems. In: Approximation Algorithms for NP-Hard Problems. PWS Publishing Co. (1996)"},{"issue":"3","key":"9_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0925-7721(99)00019-X","volume":"13","author":"T.M. Chan","year":"1999","unstructured":"Chan, T.M.: More planar two-center algorithms. Computational Geometry\u00a013(3), 189\u2013198 (1999)","journal-title":"Computational Geometry"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.comgeo.2005.10.002","volume":"35","author":"T.M. Chan","year":"2006","unstructured":"Chan, T.M.: Faster core-set constructions and data-stream algorithms in fixed dimensions. Computational Geometry\u00a035, 20\u201335 (2006)","journal-title":"Computational Geometry"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-22300-6_17","volume-title":"Algorithms and Data Structures","author":"T.M. Chan","year":"2011","unstructured":"Chan, T.M., Pathak, V.: Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol.\u00a06844, pp. 195\u2013206. Springer, Heidelberg (2011)"},{"issue":"6","key":"9_CR9","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.\u00a033(6), 1417\u20131440 (2004)","journal-title":"SIAM J. Comput."},{"key":"9_CR10","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. Journal of Algorithms\u00a021, 579\u2013597 (1996)","journal-title":"Journal of Algorithms"},{"key":"9_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Guha, S.: Tight results for clustering and summarizing data streams. In: Proc. of the 12th Int. Conf. on Database Theory, pp. 268\u2013275. ACM (2009)","DOI":"10.1145\/1514894.1514926"},{"issue":"3","key":"9_CR13","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.comgeo.2006.10.004","volume":"39","author":"J. Hershberger","year":"2008","unstructured":"Hershberger, J., Suri, S.: Adaptive sampling for geometric problems over data streams. Computational Geometry\u00a039(3), 191\u2013208 (2008)","journal-title":"Computational Geometry"},{"key":"9_CR14","unstructured":"Zarrabi-Zadeh, H.: Core-preserving algorithms. In: Proc.\u00a0of 20th Canadian Conf. on Comput. Geom. (CCCG), pp. 159\u2013162 (2008)"},{"key":"9_CR15","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. Algorithms and Techniques","author":"R.M. McCutchen","year":"2008","unstructured":"McCutchen, R.M., 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.\u00a05171, pp. 165\u2013178. Springer, Heidelberg (2008)"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0747-7171(08)80067-3","volume":"10","author":"M. Megiddo","year":"1990","unstructured":"Megiddo, M.: On the complexity of some geometric problems in unbounded dimension. J. Symbolic Comput.\u00a010, 327\u2013334 (1990)","journal-title":"J. Symbolic Comput."},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1137\/0213014","volume":"13","author":"M. Megiddo","year":"1984","unstructured":"Megiddo, M., Supowit, K.J.: On the complexity of some common geometric location problems. SIAM J. Comput.\u00a013(1), 182\u2013196 (1984)","journal-title":"SIAM J. Comput."},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-642-31770-5_24","volume-title":"Combinatorial Optimization and Applications","author":"C.K. Poon","year":"2012","unstructured":"Poon, C.K., Zhu, B.: Streaming with Minimum Space: An Algorithm for Covering by Two Congruent Balls. In: Lin, G. (ed.) COCOA 2012. LNCS, vol.\u00a07402, pp. 269\u2013280. Springer, Heidelberg (2012)"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/s00453-010-9392-2","volume":"60","author":"H. Zarrabi-Zadeh","year":"2011","unstructured":"Zarrabi-Zadeh, H.: An almost space-optimal streaming algorithm for coresets in fixed dimensions. Algorithmica\u00a060, 46\u201359 (2011)","journal-title":"Algorithmica"},{"key":"9_CR20","unstructured":"Zarrabi-Zadeh, H., Chan, T.M.: A simple streaming algorithm for minimum enclosing balls. In: Proc. of 18th CCCG, pp. 139\u2013142 (2006)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35261-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T00:02:28Z","timestamp":1557446548000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35261-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642352607","9783642352614"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35261-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}