An approximation scheme for a problem of search for a vector subset

A. V. Kel’manov and A. V. Pyatkin, “NP-Completeness of Some Problems of Choosing a Vector Subset,” Diskret. Anal. Issled. Oper. 17(5), 37–45 (2010) [J. Appl. Indust. Math. 5 (1), 352–357 (2011)].

A. V. Kel’manov and S. M. Romanchenko, “An Approximation Algorithm for Solving a Problem of Search for a Vector Subset,” Diskret. Anal. Issled. Oper. 18(1), 61–69 (2011) [J. Appl. Indust. Math. 6 (1), 90–96 (2012)].

A. V. Kel’manov and S. M. Romanchenko, “Quasipolynomial Algorithms for Some Problems of Search for a Vector Subset and Cluster Analysis,” Avtomat. i Telemekh. (2011), in press.

H. Wirth, Algorithms + Data Structures = Programs (Prentice Hall, New Jersey, 1976).