A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets

Consideration was given to the problem of seeking a family of disjoint subsets of given cardinalities in a finite set of Euclidean space vectors. The minimal sum of the squared distances from the subset elements to their centers was used as the search criterion. The subset centers are optimizable va...

Ausführliche Beschreibung