Publications in Math-Net.Ru
-
An approximation scheme for a problem of finding a subsequence
Sib. Zh. Vychisl. Mat., 20:4 (2017), 379–392
-
FPTAS for solving a problem of search for a vector subset
Diskretn. Anal. Issled. Oper., 21:3 (2014), 41–52
-
Точные псевдополиномиальные алгоритмы для некоторых труднорешаемых задач поиска подпоследовательности векторов
Zh. Vychisl. Mat. Mat. Fiz., 53:1 (2013), 143–153
-
Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems
Avtomat. i Telemekh., 2012, no. 2, 156–162
-
Approximation algorithms for some NP-hard problems of searching a vectors subsequence
Diskretn. Anal. Issled. Oper., 19:3 (2012), 27–38
-
The approximation algorithm for one problem of searching for subset of vectors
Diskretn. Anal. Issled. Oper., 18:1 (2011), 61–69
© , 2024