Accurate pseudopolynomial-time algorithms for certain NP-hard problems of searching for a vector subsequence (Q2838802)

The authors investigate certain NP-hard problems searching for a subsequence or a sequence in an Euclidean vector space. The required subsequence is supposed to include a fixed number of vectors, which are closely posed with respect to the criterion of the minimum of sum of square distances. The choice of vectors is constrained by the condition that the differences of the preceding and subsequent number have upper and lower bounds by some constants.