1. Aloise, D., & Hansen, P. (2007). On the complexity of minimum sum-of-squares clustering. Cahiers du GERAD, G-2007-50, July 2007, available online at http://www.gerad.ca .
2. Arthur, D., & Vassilvitskii, S. (2007). K-means++: the advantages of careful seeding. In 2007 ACM-SIAM symposium on discrete algorithms (SODA’07).
3. Beringer, J., & Hüllermeier, E. (2006). Online clustering of parallel data streams. Data & Knowledge Engineering, 58, 180–204.
4. Cilibrasi, R., van Iersel, L., Kelk, S., & Tromp, J. (2005). On the complexity of several haplotyping problems. Lecture Notes in Computer Science, 3692, 128–139.
5. Dasgupta, S. (2008). The hardness of k -means clustering (Technical Report CS2008-0916). University of California, 17 January 2008.