An Approximation Algorithm for a Problem of Partitioning a Sequence into Clusters with Constraints on Their Cardinalities
- 14 Downloads
We consider the problem of partitioning a finite sequence of points in Euclidean space into a given number of clusters (subsequences) minimizing the sum over all clusters of intracluster sums of squared distances of elements of the clusters to their centers. It is assumed that the center of one of the desired clusters is the origin, while the centers of the other clusters are unknown and are defined as the mean values of cluster elements. Additionally, there are a few structural constraints on the elements of the sequence that enter the clusters with unknown centers: (1) the concatenation of indices of elements of these clusters is an increasing sequence, (2) the difference between two consequent indices is lower and upper bounded by prescribed constants, and (3) the total number of elements in these clusters is given as an input. It is shown that the problem is strongly NP-hard. A 2-approximation algorithm that is polynomial for a fixed number of clusters is proposed for this problem.
Keywordspartitioning sequence Euclidean space minimum sum of squared distances NP-hardness approximation algorithm.
Unable to display preview. Download preview PDF.
- 2.Remote Sensing Time Series: Revealing Land Surface Dynamics, Ed. by C. Kuenzer, S. Dech, and W. Wagner (Springer, New York, 2015), Ser. Remote Sensing and Digital Image Processing 22.Google Scholar
- 8.A. V. Kel’manov, S. A. Khamidullin, and V. I. Khandeev, “An exact pseudopolynomial algorithm for a sequence 2-cluster partitioning problem,” in Proceedings of the 15th All-Russia Conference on Mathematical Programming and Applications, Yekaterinburg, Russia, 2015 (IMM UrO RAN, Yekaterinburg, 2015), p. 139.Google Scholar