Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence

Alexander Kel’manov, Sergey Khamidullin, Vladimir Khandeev, Artem Pyatkin

Результат исследования: Научные публикации в периодических изданияхстатья

Аннотация

The following two strongly NP-hard problems are considered. In the first problem, we need to find in the given finite set of points in Euclidean space the subset of largest size. The sum of squared distances between the elements of this subset and its unknown centroid (geometrical center) must not exceed a given value. This value is defined as percentage of the sum of squared distances between the elements of the input set and its centroid. In the second problem, the input is a sequence (not a set) and we have some additional constraints on the indices of the elements of the chosen subsequence. The restriction on the sum of squared distances is the same as in the first problem. Both problems can be treated as data editing problems aimed to find similar elements and removal of extraneous (dissimilar) elements. We propose exact algorithms for the cases of both problems in which the input points have integer-valued coordinates. If the space dimension is bounded by some constant, our algorithms run in a pseudopolynomial time. Some results of numerical experiments illustrating the performance of the algorithms are presented.

Язык оригиналаанглийский
Страницы (с-по)157-168
Число страниц12
ЖурналAnnals of Mathematics and Artificial Intelligence
Том88
Номер выпуска1-3
DOI
СостояниеОпубликовано - 1 мар 2020

    Fingerprint

Цитировать