Author:
Kel’manov A. V.,Khamidullin S. A.,Khandeev V. I.,Pyatkin A. V.,Shamardin Yu. V.,Shenmaier V. V.
Subject
Computer Graphics and Computer-Aided Design,Computer Vision and Pattern Recognition
Reference19 articles.
1. A. A. Ageev, A. V. Kel’manov, A. V. Pyatkin, S. A. Khamidullin, and V. V. Shenmaier, “Approximation polynomial algorithm for the data editing and data cleaning problem,” Pattern Recogn. Image Anal. 17 (3), 365–370 (2017).
2. A. V. Kel’manov and A. V. Pyatkin, “On the complexity of some problems of choosing a vector subsequence,” Zh. Vychisl. Mat. Mat. Fiz. 52 (12), 2284–2291 (2012) [in Russian].
3. A. V. Kel’manov, S. M. Romanchenko, and S. A. Khamidullin, “Approximation algorithms for some intractable problems of choosing a vector subsequence,” J. Appl. Indust. Math. 6 (4), 443–450 (2012).
4. A. V. Kel’manov, S. M. Romanchenko, and S. A. Khamidullin, “Exact pseudopolynomial algorithms for some NP-hard problems of searching a vectors subsequence,” Zh. Vychisl. Mat. Mat. Fiz. 53 (1), 143–153 (2013) [in Russian].
5. A. V. Kel’manov, S. M. Romanchenko, and S. A. Khamidullin, “An approximation scheme for the problem of finding a subsequence,” Num. Anal. Appl. 10 (4), 313–323 (2017).