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

  1. 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 journal › Article › peer-review

  2. 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 journal › Article › peer-review

  3. An approximation scheme for a weighted two-cluster partition problem

    Kel’manov, A., Motkova, A. & Shenmaier, V., 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. 323-333 11 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 proceeding › Conference contribution › Research › peer-review

  4. An approximation polynomial-time algorithm for a cardinality-weighted 2-clustering problem

    Kel'Manov, A. & Motkova, A., 14 Nov 2017, Proceedings - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017. Institute of Electrical and Electronics Engineers Inc., p. 94-96 3 p. 8109845

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

  5. Algorithms with performance guarantee for a weighted 2-partition problem

    Kel'Manov, A. & Motkova, A., 2017, In: CEUR Workshop Proceedings. 1987, p. 304-309 6 p.

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

  6. A fully polynomial-time approximation scheme for a special case of a balanced 2-clustering problem

    Kel’manov, A. & Motkova, A., 2016, Discrete Optimization and Operations Research - 9th International Conference, DOOR 2016, Proceedings. Khachay, M., Pardalos, P., Kochetov, Y., Beresnev, V. & Nurminski, E. (eds.). Springer, p. 182-192 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9869 LNCS).

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

  7. 2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence

    Kel’manov, A., Khamidullin, S. & Panasenko, A., 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. 386-393 8 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

Previous 1 2 Next

ID: 9103807