{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:40:24Z","timestamp":1742596824049,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540577850"},{"type":"electronic","value":"9783540483328"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57785-8_164","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:20:10Z","timestamp":1330262410000},"page":"475-486","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient parallel algorithms for geometric k-clustering problems"],"prefix":"10.1007","author":[{"given":"Amitava","family":"Datta","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"38_CR1","volume-title":"Introduction to Mathematical Techniques in Pattern Recognition","author":"H. C. Andrews","year":"1972","unstructured":"H. C. Andrews. Introduction to Mathematical Techniques in Pattern Recognition. Wiley-Interscience, New York, 1972."},{"key":"38_CR2","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/0196-6774(91)90022-Q","volume":"12","author":"A. Aggarwal","year":"1991","unstructured":"A. Aggarwal, H. Imai, N. Katoh and S. Suri. Finding k points with minimum diameter and related problems. J. Algorithms 12 (1991), pp. 38\u201356.","journal-title":"J. Algorithms"},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"O. Berkman, D. Breslauer, Z. Galil, B. Scheiber and U. Vishkin. Highly parallelizable problems, Proc. 21st Annual ACM Symp. on Theory of Computing, 1989, pp. 309\u2013319.","DOI":"10.1145\/73007.73036"},{"key":"38_CR4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF01758750","volume":"7","author":"S. Chandran","year":"1992","unstructured":"S. Chandran, S. K. Kim and D. M. Mount. Parallel computational geometry of rectangles. Algorithmica, 7, (1992), pp. 25\u201349.","journal-title":"Algorithmica"},{"key":"38_CR5","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","volume":"17","author":"R. Cole","year":"1988","unstructured":"R. Cole. Parallel merge sort. SIAM J. Comput. 17, (1988), pp. 770\u2013785.","journal-title":"SIAM J. Comput"},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"A. Datta, H. P. Lenhof, C. Schwarz and M. Smid. Static and dynamic algorithms for k-point clustering problems. Proceedings of WADS '93, Lecture Notes in Computer Science, Springer-Verlag, Vol. 709, pp. 265\u2013276.","DOI":"10.1007\/3-540-57155-8_254"},{"key":"38_CR7","unstructured":"D. Eppstein and J. Erickson. Iterated nearest neighbours and finding minimal polytopes. Proc. 4th ACM-SIAM Symp. on Discrete Algorithms, (1993), pp. 64\u201373."},{"key":"38_CR8","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0022-0000(82)90048-4","volume":"24","author":"G. N. Prederickson","year":"1982","unstructured":"G. N. Prederickson and D. B. Johnson. The complexity of selection and ranking in X + Y and matrices with sorted columns. Journal of Computer and System Sciences, 24, (1982), pp. 197\u2013208.","journal-title":"Journal of Computer and System Sciences"},{"key":"38_CR9","volume-title":"Clustering Algorithms","author":"J. A. Hartigan","year":"1975","unstructured":"J. A. Hartigan. Clustering Algorithms, John-Wiley, New York, 1975."},{"key":"38_CR10","unstructured":"J. J\u00e1J\u00e1. An introduction to Parallel Algorithms. Addison-Wesley, 1992."},{"key":"38_CR11","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1137\/0207013","volume":"7","author":"D. B. Johnson","year":"1978","unstructured":"D. B. Johnson and T. Mizoguchi. Selecting the Kth element in X + Y and X1 + X2 + + X m . SIAM J. Comput. 7, (1978), pp. 147\u2013157.","journal-title":"SIAM J. Comput"},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"H. P. Lenhof and M. Smid. Sequential and parallel algorithms for the k-closest pairs problem. Max Planck Institut f\u00fcr Informatik, Technical Report, MPI-I-92-134, August 1992. A preliminary version appears in Proc. 33rd Annual IEEE Symp. on Foundations of Computer Science, pp. 380\u2013386.","DOI":"10.1109\/SFCS.1992.267752"},{"key":"38_CR13","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":"F. P. Preparata and M. I. Shamos. Computational Geometry: an Introduction. Springer-Verlag, New York, 1985."},{"key":"38_CR14","unstructured":"R. Sarnath and X. He. Efficient parallel algorithms for selection and searching on sorted matrices. Proc. 6th International Parallel Processing Symposium, (1992), pp. 108\u2013111."}],"container-title":["Lecture Notes in Computer Science","STACS 94"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57785-8_164","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:12:50Z","timestamp":1742595170000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57785-8_164"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540577850","9783540483328"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-57785-8_164","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"31 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}