1 - 10 out of 39Page size: 10
Sort by: Title

  1. The Problem K-Means and Given J-Centers: Polynomial Solvability in One Dimension

    Kel’manov, A. & Khandeev, V., 1 Jan 2019, Mathematical Optimization Theory and Operations Research - 18th International Conference, MOTOR 2019, Revised Selected Papers. Bykadorov, I., Strusevich, V. & Tchemisova, T. (eds.). Springer International Publishing AG, p. 207-216 10 p. (Communications in Computer and Information Science; vol. 1090 CCIS).

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

  2. Some algorithms with guaranteed accuracy for 2-clustering problems with given center of one cluster

    Kel'Manov, A. & Khandeev, V., 14 Nov 2017, Proceedings - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017. Institute of Electrical and Electronics Engineers Inc., p. 91-93 3 p. 8109844

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

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

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

  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. Quadratic Euclidean 1-Mean and 1-Median 2-Clustering Problem with constraints on the size of the clusters: Complexity and approximability

    Kel'manov, A. V. E., Pyatkin, A. V. E. & Khandeev, V. I. I., 1 Jan 2019, In: Trudy Instituta Matematiki i Mekhaniki UrO RAN. 25, 4, p. 69-78 10 p.

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

  7. Pseudo-polynomial Algorithms for Some Problems of Searching for the Largest Subsets

    Khandeev, V. & Neshchadim, S., 20 Dec 2024, Communications in Computer and Information Science. Springer, p. 319-333 15 p. 22. (Communications in Computer and Information Science; vol. 2239 CCIS).

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

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

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

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

Previous 1 2 3 4 Next

ID: 3431543