Chang, Kevin L.; Kannan, Ravi The space complexity of pass-efficient algorithms for clustering. (English) Zbl 1194.62085 Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, January 22–24, 2006. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-605-5). 1157-1166 (2006). Cited in 2 Documents MSC: 62H30 Classification and discrimination; cluster analysis (statistical aspects) 65Y99 Computer aspects of numerical algorithms PDFBibTeX XMLCite \textit{K. L. Chang} and \textit{R. Kannan}, in: Proceedings of the seventeenth annual ACM-SIAM symposium on discrete algorithms, SODA 2006, Miami, FL, January 22--24, 2006. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 1157--1166 (2006; Zbl 1194.62085) Full Text: DOI