Gimadi, E. K., & Rykov, I. A. (2015). A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum. Journal of Applied and Industrial Mathematics, 9(3), 351-357. https://doi.org/10.1134/s1990478915030060
ISO-690 (author-date, English)GIMADI, E. Kh. and RYKOV, I. A., 2015. A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum. Journal of Applied and Industrial Mathematics. 1 July 2015. Vol. 9, no. 3, p. 351-357. DOI 10.1134/s1990478915030060.
Modern Language Association 9th editionGimadi, E. K., and I. A. Rykov. “A Randomized Algorithm for Finding a Subset of Vectors With the Maximum Euclidean Norm of Their Sum”. Journal of Applied and Industrial Mathematics, vol. 9, no. 3, July 2015, pp. 351-7, https://doi.org/10.1134/s1990478915030060.
Mohr Siebeck - Recht (Deutsch - Österreich)Gimadi, E. Kh./Rykov, I. A.: A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum, Journal of Applied and Industrial Mathematics 2015, 351-357.
Emerald - HarvardGimadi, E.K. and Rykov, I.A. (2015), “A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum”, Journal of Applied and Industrial Mathematics, Vol. 9 No. 3, pp. 351-357.