1. Aloise, D., Deshpande, A., Hansen, P., Popat, P.: Np-hardness of euclidean sum-of-squares clustering. Machine Learning 75(2), 245–248 (2009)
2. Arthur, D., and Vassilvitskii, S.: k-means++: The advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 1027–1035. Society for Industrial and Applied Mathematics (2007)
3. Bejarano, J., Bose, K., Brannan, T., Thomas, A., Adragni, K., Neerchal, N., Ostrouchov, G.: Sampling within k-means algorithm to cluster large datasets. Tech. rep., Oak Ridge National Laboratory (ORNL); Center for Computational Sciences (2011)
4. Chakravarty, S.: Sample size determination for multinomial population. In: National Association for Welfare Research and Statistics 39th Annual Workshop (1999)
5. Demetrescu, C., Goldberg, A., Johnson, D.: 9th dimacs implementation challenge-shortest paths. American Mathematical Society (2006)