11 - 20 out of 39Page size: 10
  1. 2020

  2. Exact Linear-Time Algorithm for Parameterized K-Means Problem with Optimized Number of Clusters in the 1D Case

    Kel’manov, A. & Khandeev, V., 1 Jan 2020, Numerical Computations: Theory and Algorithms - 3rd International Conference, NUMTA 2019, Revised Selected Papers. Sergeyev, Y. D. & Kvasov, D. E. (eds.). Springer Gabler, p. 394-399 6 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11974 LNCS).

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

  3. On the Complexity of Some Quadratic Euclidean Partition Problems into Balanced Clusters

    Kel’manov, A., Khandeev, V. & Pyatkin, A., 1 Jan 2020, Optimization and Applications - 10th International Conference, OPTIMA 2019, Revised Selected Papers. Jaćimović, M., Khachay, M., Malkova, V. & Posypkin, M. (eds.). Springer Gabler, p. 127-136 10 p. (Communications in Computer and Information Science; vol. 1145 CCIS).

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

  4. Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation

    Khandeev, V., 1 Jan 2020, Numerical Computations: Theory and Algorithms - 3rd International Conference, NUMTA 2019, Revised Selected Papers. Sergeyev, Y. D. & Kvasov, D. E. (eds.). Springer Gabler, p. 400-405 6 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11974 LNCS).

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

  5. Complexity of Some Problems of Quadratic Partitioning of a Finite Set of Points in Euclidean Space into Balanced Clusters

    Kel’manov, A. V., Pyatkin, A. V. & Khandeev, V. I., Jan 2020, In: Computational Mathematics and Mathematical Physics. 60, 1, p. 163-170 8 p.

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

  6. 2019

  7. NP-hardness of quadratic euclidean 1-mean and 1-median 2-clustering problem with constraints on the cluster sizes

    Kel’manov, A. V., Pyatkin, A. V. & Khandeev, V. I., Nov 2019, In: Doklady Mathematics. 100, 3, p. 545-548 4 p.

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

  8. NP-Completeness of Some Problems of Partitioning a Finite Set of Points in Euclidean Space into Balanced Clusters

    Kel’manov, A. V., Pyatkin, A. V. & Khandeev, V. I., 1 Sept 2019, In: Doklady Mathematics. 100, 2, p. 416-419 4 p.

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

  9. Polynomial-Time Solvability of the One-Dimensional Case of an NP-Hard Clustering Problem

    Kel’manov, A. V. & Khandeev, V. I., 1 Sept 2019, In: Computational Mathematics and Mathematical Physics. 59, 9, p. 1553-1561 9 p.

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

  10. On Polynomial Solvability of One Quadratic Euclidean Clustering Problem on a Line

    Kel’manov, A. V. & Khandeev, V. I., 1 Jul 2019, In: Doklady Mathematics. 100, 1, p. 339-342 4 p.

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

  11. 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

  12. 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

Previous 1 2 3 4 Next

ID: 3431543