An approximation algorithm for solving a problem of search for a vector subset

Abstract

One of the problems in data analysis was earlier reduced to a specific NP-hard optimization problem of finding in a given vector set in the Euclidean space a subset of a given cardinality such that the subset consists of the vectors that are “close” to each other by the criterion of the minimum sum of squared distances. In the paper an efficient 2-approximation algorithm is proposed for solving this problem.