APA (7th ed.) Citation

Kel’manov, A. V., & Motkova, A. V. (2018). Polynomial-Time Approximation Algorithm for the Problem of Cardinality-Weighted Variance-Based 2-Clustering with a Given Center. Computational mathematics and mathematical physics, 58(1), 130-136. https://doi.org/10.1134/S0965542518010074

Chicago Style (17th ed.) Citation

Kel’manov, A. V., and A. V. Motkova. "Polynomial-Time Approximation Algorithm for the Problem of Cardinality-Weighted Variance-Based 2-Clustering with a Given Center." Computational Mathematics and Mathematical Physics 58, no. 1 (2018): 130-136. https://doi.org/10.1134/S0965542518010074.

MLA (9th ed.) Citation

Kel’manov, A. V., and A. V. Motkova. "Polynomial-Time Approximation Algorithm for the Problem of Cardinality-Weighted Variance-Based 2-Clustering with a Given Center." Computational Mathematics and Mathematical Physics, vol. 58, no. 1, 2018, pp. 130-136, https://doi.org/10.1134/S0965542518010074.