Exact pseudopolynomial algorithm for one sequence partitioning problem
- 34 Downloads
We consider a strongly NP-hard problem of partitioning a finite sequence of vectors in a Euclidean space into two clusters of given size with the criterion of minimizing the total sum of square distances from cluster elements to their centers. The center of the first cluster is subject to optimization, defined by the mean value of all vectors in this cluster. The center of the second cluster is fixed at the origin. The partition is subject to the following condition: the difference between indices of two subsequent vectors included in the first cluster is bounded from above and below by given constants. We propose an exact pseudopolynomial algorithm for the case of a problem where the dimension of the space is fixed, and components of input vectors are integer-valued.
Key wordspartition sequence of vectors Euclidean space minimal sum of squared distances NP-hardness exact pseudopolynomial algorithm
Unable to display preview. Download preview PDF.
- 14.Carter, J.A. and Agol, E., The Quasiperiodic Automated Transit Search Algorithm, Astrophysic. J., 2013, vol. 765, no. 2, doi:10.1088/0004-637X/765/2/132.Google Scholar
- 18.Dolgushev, A.V., Kel’manov, A.V., and Shenmaier, V.V., A Polynomial Approximation Scheme for One Problem of Partitioning a Finite Set into Two Clusters, Tr. Inst. Mat. Mekh. UrO RAN, 2015, vol. 21, no. 3, pp. 100–109.Google Scholar