Volume 21, No 1, 2014, P. 53–66

UDC 519.16 + 519.85
A. V. Kelmanov, S. A. Khamidulin
Approximation algorithm for one problem of partitioning a sequence

We consider one NP-hard problem of partitioning of a finite Euclidean vectors sequence into two clusters minimizing the sum of squared distances from the clusters elements to their centers. The cardinalities of the clusters are fixed. The center of the first cluster is defined as the mean value of all vectors in a cluster. The center of the second cluster is given in advance and is equal to 0. Additionally, the partition must satisfy the restriction that for all vectors that are in the first cluster the difference between the indices of two consequent vectors from this cluster is bounded from below and above by some constants. An effective 2-approximation algorithm for the problem is presented. 
Bibliogr. 9.

Keywords:  Euclidean vectors sequence, ˝lusterization, minimum sum-of-squared distances, NP-hardness, effective 2-approximation algorithm.

Kel’manov Alexander Vasilyevich 1,2
Khamidullin Sergey Asgadullovich 1

1. Sobolev Institute of Mathematics,
4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia
2. Novosibirsk State University,
2 Pirogov St., 630090 Novosibirsk, Russia
e-mail: kelm@math.nsc.ru, orlab@math.nsc.ru 

 © Sobolev Institute of Mathematics, 2015