Approximation Scheme for a Quadratic Euclidean Weighted 2-Clustering Problem
- 8 Downloads
We consider the strongly NP-hard problem of partitioning a finite set of Euclidean points into two clusters so as to minimize the sum (over both clusters) of the weighted sums of the squared intra-cluster distances from the elements of the cluster to its center. The weights of the sums are equal to the cardinalities of the clusters. The center of one of the clusters is given as input, while the center of the other cluster is unknown and is determined as the mean value over all points in this cluster, i.e., as the geometric center (centroid). The version of the problem with constrained cardinalities of the clusters is analyzed. We construct an approximation algorithm for the problem and show that it is a fully polynomial-time approximation scheme (FPTAS) if the space dimension is bounded by a constant.
Keywordsdata analysis weighted 2-clustering Euclidean space NP-hardness fixed space dimension FPTAS
Unable to display preview. Download preview PDF.
- 15.S. Hasegawa, H. Imai, M. Inaba, N. Katoh, and J. Nakano, “Efficient algorithms for variance-based - Clustering,” in Proc. 1st Pacific Conf. on Computer Graphics and Applications Seoul, Korea, August 30–September 2, 1993), Vol. 1 (World Scientific, River Edge, NJ, 1993), pp. 75–89.Google Scholar
- 16.M. Inaba, N. Katoh, and H. Imai, “Applications of weighted Voronoi diagrams and randomization to variance- based -clustering: (extended abstract),” in Proc. 10th ACM Symposium on Computational Geometry (Stony Brook, New York, USA, June 6–8, 1994), (ACM, New York, 1994), pp. 332–339.Google Scholar
- 17.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).Google Scholar
- 23.A. V. Kel’manov and A. V. Motkova, “A fully polynomial- time approximation scheme for a special case of a balanced 2-clustering problem,” in Discrete Optimization and Operations Research: Proc. 9th Intern. Conf. DOOR 2016 (Vladivostok, Russia, September 19–23, 2016), Lecture Notes Comp. Sci. 9869, 182–192 (2016).MathSciNetCrossRefMATHGoogle Scholar