Fully Polynomial-Time Approximation Scheme for a Problem of Finding a Subsequence

Abstract

We consider a strongly NP-hard Euclidean problem of finding a subsequence in a finite sequence under the criterion of the minimum sum of squared distances from the elements of sought subsequence to its geometric center (centroid). It is assumed that the sought subsequence contains a given number of elements. In addition, sought subsequence has to satisfy… (More)

Topics

  • Presentations referencing similar topics