11 - 17 out of 17Page size: 10
Sort by: Title

  1. Exact algorithms for the special cases of two hard to solve problems of searching for the largest subset

    Kel’manov, A., Khandeev, V. & Panasenko, A., 1 Jan 2018, Analysis of Images, Social Networks and Texts - 7th International Conference, AIST 2018, Revised Selected Papers. Panchenko, A., van der Aalst, W. M., Khachay, M., Pardalos, P. M., Batagelj, V., Loukachevitch, N., Glavaš, G., Ignatov, D. I., Kuznetsov, S. O., Koltsova, O., Lomazova, I. A., Savchenko, A. V., Napoli, A. & Pelillo, M. (eds.). Springer, p. 294-304 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11179 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  2. Exact Algorithms of Search for a Cluster of the Largest Size in Two Integer 2-Clustering Problems

    Kel′manov, A. V., Panasenko, A. V. & Khandeev, V. I., 1 Apr 2019, In: Numerical Analysis and Applications. 12, 2, p. 105-115 11 p.

    Research output: Contribution to journal › Article › peer-review

  3. Exact pseudopolynomial algorithms for a balanced 2-clustering problem

    Kel’manov, A. V. & Motkova, A. V., 1 Jul 2016, In: Journal of Applied and Industrial Mathematics. 10, 3, p. 349-355 7 p.

    Research output: Contribution to journal › Article › peer-review

  4. Polynomial-Time Approximation Algorithm for the Problem of Cardinality-Weighted Variance-Based 2-Clustering with a Given Center

    Kel’manov, A. V. & Motkova, A. V., 1 Jan 2018, In: Computational Mathematics and Mathematical Physics. 58, 1, p. 130-136 7 p.

    Research output: Contribution to journal › Article › peer-review

  5. Randomized algorithms for some clustering problems

    Kel’manov, A., Khandeev, V. & Panasenko, A., 1 Jan 2018, Optimization Problems and Their Applications - 7th International Conference, OPTA 2018, Revised Selected Papers. Springer, p. 109-119 11 p. (Communications in Computer and Information Science; vol. 871).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  6. Randomized Algorithms for Some Hard-to-Solve Problems of Clustering a Finite Set of Points in Euclidean Space

    Kel’manov, A. V., Panasenko, A. V. & Khandeev, V. I., 1 May 2019, In: Computational Mathematics and Mathematical Physics. 59, 5, p. 842-850 9 p.

    Research output: Contribution to journal › Article › peer-review

  7. Randomized algorithms for some sequence clustering problems

    Khamidullin, S., Khandeev, V. & Panasenko, A., 1 Jun 2020, Learning and Intelligent Optimization - 14th International Conference, LION 14, 2020, Revised Selected Papers. Kotsireas, I. S. & Pardalos, P. M. (eds.). Springer Gabler, p. 96-101 6 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12096 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Previous 1 2 Next

ID: 9103807