1 - 10 out of 37Page size: 10
  1. 2023

  2. Constant-Factor Approximation Algorithms for Some Maximin Multi-clustering Problems

    Khandeev, V. & Neshchadim, S., 2023, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Science and Business Media Deutschland GmbH, p. 85-100 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13930 LNCS).

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

  3. 2022

  4. Approximate Algorithms for Some Maximin Clustering Problems

    Khandeev, V. & Neshchadim, S., 2022, Mathematical Optimization Theory and Operations Research: Recent Trends - 21st International Conference, MOTOR 2022, Revised Selected Papers. Kochetov, Y., Eremeev, A., Khamisov, O. & Rettieva, A. (eds.). Springer Science and Business Media Deutschland GmbH, p. 89-103 15 p. (Communications in Computer and Information Science; vol. 1661 CCIS).

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

  5. 2021

  6. Max-Min Problems of Searching for Two Disjoint Subsets

    Khandeev, V. & Neshchadim, S., 2021, Optimization and Applications - 12th International Conference, OPTIMA 2021, Proceedings. Olenev, N. N., Evtushenko, Y. G., Jaćimović, M., Khachay, M. & Malkova, V. (eds.). Springer Science and Business Media Deutschland GmbH, p. 231-245 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13078 LNCS).

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

  7. 2020

  8. On the Complexity of SomeMax-Min Clustering Problems

    Kel'manov, A. V., Pyatkin, A. V. & Khandeev, V. I., Aug 2020, In: Proceedings of the Steklov Institute of Mathematics. 309, SUPPL 1, p. S65-S73 9 p.

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

  9. Exact Algorithm for the One-Dimensional Quadratic Euclidean Cardinality-Weighted 2-Clustering with Given Center Problem

    Khandeev, V. & Panasenko, A., Jul 2020, Mathematical Optimization Theory and Operations Research - 19th International Conference, MOTOR 2020, Revised Selected Papers. Kochetov, Y., Bykadorov, I. & Gruzdeva, T. (eds.). Springer Science and Business Media Deutschland GmbH, p. 30-35 6 p. (Communications in Computer and Information Science; vol. 1275 CCIS).

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

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

  11. Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence

    Kel’manov, A., Khamidullin, S., Khandeev, V. & Pyatkin, A., 1 Mar 2020, In: Annals of Mathematics and Artificial Intelligence. 88, 1-3, p. 157-168 12 p.

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

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

    Kel’manov, A. & Khandeev, V., 22 Jan 2020, Learning and Intelligent Optimization - 13th International Conference, LION 13, Revised Selected Papers. Matsatsinis, N. F., Marinakis, Y. & Pardalos, P. (eds.). Springer Gabler, p. 46-52 7 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11968 LNCS).

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

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

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