1. S. Sahni and T. Gonzalez, J. ACM 23, 555–566 (1976).
2. P. Brucker, Lect. Notes Econ. Math. Syst. 157, 45–54 (1978).
3. F. de la Vega and C. Kenyon, J. Comput. Syst. Sci. 63, 531–541 (2001).
4. F. de la Vega, M. Karpinski, C. Kenyon, and Y. Rabani, “Polynomial time approximation schemes for metric min-sum clustering,” Electronic Colloquium on Computational Complexity (ECCC), Report No. 25 (2002).
5. M. Inaba, N. Katoh, and H. Imai, “Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering (extended abstract),” Proceedings of the 10th ACM Symposium on Computational Geometry (Stony Brook, New York, 1994), pp. 332–339.