1. A quadratic part of a bent function can be any

    Tokareva, N. N., 2022, In: Siberian Electronic Mathematical Reports. 19, 1, p. 342-347 6 p.

    Research output: Contribution to journalArticlepeer-review

  2. A Probabilistic Model of Fuzzy Clustering Ensemble

    Berikov, V. B., 1 Jan 2018, In: Pattern Recognition and Image Analysis. 28, 1, p. 1-10 10 p.

    Research output: Contribution to journalArticlepeer-review

  3. Approximation Scheme for the Problem of Weighted 2-Clustering with a Fixed Center of One Cluster

    Kel’manov, A. V., Motkova, A. V. & Shenmaier, V. V., 1 Dec 2018, In: Proceedings of the Steklov Institute of Mathematics. 303, p. 136-145 10 p.

    Research output: Contribution to journalArticlepeer-review

  4. Approximation Scheme for a Quadratic Euclidean Weighted 2-Clustering Problem

    Kel’manov, A. V. & Motkova, A. V., 1 Jan 2018, In: Pattern Recognition and Image Analysis. 28, 1, p. 17-23 7 p.

    Research output: Contribution to journalArticlepeer-review

  5. Approximation polynomial algorithm for the data editing and data cleaning problem

    Ageeva, A. A., Kel’manov, A. V., Pyatkin, A. V., Khamidullin, S. A. & Shenmaier, V. V., 1 Jul 2017, In: Pattern Recognition and Image Analysis. 27, 3, p. 365-370 6 p.

    Research output: Contribution to journalArticlepeer-review

  6. Approximation of the competitive facility location problem with MIPs

    Beresnev, V. & Melnikov, A., 1 Apr 2019, In: Computers and Operations Research. 104, p. 139-148 10 p.

    Research output: Contribution to journalArticlepeer-review

  7. Approximation algorithms for the maximum m-peripatetic salesman problem

    Gimadi, E. K. & Tsidulko, O. Y., 1 Jan 2018, Analysis of Images, Social Networks and Texts - 6th International Conference, AIST 2017, Revised Selected Papers. VanDerAalst, WMP., Ignatov, DI., Khachay, M., Kuznetsov, SO., Lempitsky, Lomazova, IA., Loukachevitch, N., Napoli, A., Panchenko, A., Pardalos, PM., Savchenko, AV. & Wasserman, S. (eds.). Springer, p. 304-312 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10716 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

  8. Approximation algorithm for the problem of partitioning a sequence into clusters

    Kel’manov, A. V., Mikhailova, L. V., Khamidullin, S. A. & Khandeev, V. I., 1 Aug 2017, In: Computational Mathematics and Mathematical Physics. 57, 8, p. 1376-1383 8 p.

    Research output: Contribution to journalArticlepeer-review

  9. Approximation algorithm for a quadratic euclidean problem of searching a subset with the largest cardinality

    Ageev, A. A., Kel'Manov, A. V., Pyatkin, A. V., Khamidullin, S. A. & Shenmaier, V. V., 1 Jan 2017, In: CEUR Workshop Proceedings. 1987, p. 19-23 5 p.

    Research output: Contribution to journalConference articlepeer-review

  10. Approximability and inapproximability for maximum k-edge-colored clustering problem

    Alhamdan, Y. M. & Kononov, A., 1 Jan 2019, Computer Science – Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Proceedings. van Bevern, R. & Kucherov, G. (eds.). Springer, p. 1-12 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11532 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

ID: 3086997