Approximation scheme for the problem of weighted 2-partitioning with a fixed center of one cluster
A. V. Kel'manovab, A. V. Motkovab, V. V. Shenmaiera
a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
b Novosibirsk State University
We consider the intractable problem of partitioning a finite set of points in Euclidean space into two clusters with minimum sum over the clusters of weighted sums of squared distances between the elements of the clusters and their centers. The center of one cluster is unknown and is defined as the mean value of its elements (i.e., it is the centroid of the cluster). The center of the other cluster is fixed at the origin. The weight factors for the intracluster sums are given as input. We present an approximation algorithm for this problem, which is based on the adaptive grid approach to finding the center of the optimal cluster. We show that the algorithm implements a fully polynomial-time approximation scheme (FPTAS) in the case of fixed space dimension. If the dimension is not fixed but is bounded by a slowly growing function of the number of input points, the algorithm realizes a polynomial-time approximation scheme (PTAS).
Euclidean space, partitioning, NP-hardness, FPTAS, PTAS.
PDF file (221 kB)
MSC: 68W25, 68Q25
A. V. Kel'manov, A. V. Motkova, V. V. Shenmaier, “Approximation scheme for the problem of weighted 2-partitioning with a fixed center of one cluster”, Trudy Inst. Mat. i Mekh. UrO RAN, 23, no. 3, 2017, 159–170
Citation in format AMSBIB
\by A.~V.~Kel'manov, A.~V.~Motkova, V.~V.~Shenmaier
\paper Approximation scheme for the problem of weighted 2-partitioning with a fixed center of one cluster
\serial Trudy Inst. Mat. i Mekh. UrO RAN
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|