1. A. V. Kel’manov and A. V. Pyatkin, “NP-Completeness of Some Problems of Choosing a Vector Subset,” Diskretn. Anal. Issled. Oper. 17(5), 37–45 (2010) [J. Appl. Indust. Math. 5 (3), 352–357 (2011)].
2. A. V. Kel’manov and S. M. Romanchenko, “An Approximation Algorithm for Solving a Problem of Search for a Vector Subset,” Diskretn. Anal. Issled. Oper. 18(1), 61–69 (2011) [J. Appl. Indust. Math. 6 (1), 90–96 (2012)].
3. A. V. Kel’manov and S. M. Romanchenko, “Pseudopolynomial Algorithms for Certain Computationally Hard Vector Subset and Cluster Analysis Problems,” Avtomat. i Telemekh. No 2, 156–162 (2012) [Automat. Remote Control 73 2), 349–354 (2012)].
4. V. V. Shenmaier, “An Approximation Scheme for a Problem of Search for a Vector Subset,” Diskretn. Anal. Issled. Oper. 19(2), 92–100 (2019) [J. Appl. Indust. Math. 6 (3), 381–386 (2012)].
5. D. Aloise, A. Deshpande, P. Hansen, and P. Popat, “NP-Hardness of Euclidean Sum-of-Squares Clustering,” Les Cahiers du GERAD, G-2008-33 (2008) [Machine Learning, 75 (2), 245–248 (2009)].