Kel’manov, A. V., & Khandeev, V. I. (2016). Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem. Computational mathematics and mathematical physics, 56(2), 334-341. https://doi.org/10.1134/S0965542516020111
Citace podle Chicago (17th ed.)Kel’manov, A. V., a V. I. Khandeev. "Fully Polynomial-time Approximation Scheme for a Special Case of a Quadratic Euclidean 2-clustering Problem." Computational Mathematics and Mathematical Physics 56, no. 2 (2016): 334-341. https://doi.org/10.1134/S0965542516020111.
Citace podle MLA (9th ed.)Kel’manov, A. V., a V. I. Khandeev. "Fully Polynomial-time Approximation Scheme for a Special Case of a Quadratic Euclidean 2-clustering Problem." Computational Mathematics and Mathematical Physics, vol. 56, no. 2, 2016, pp. 334-341, https://doi.org/10.1134/S0965542516020111.