171 - 180 out of 352Page size: 10
Sort by: Title

  1. NP-hardness of some max-min clustering problems

    Kel’manov, A., Khandeev, V. & Pyatkin, A., 1 Jan 2019, Optimization and Applications - 9th International Conference, OPTIMA 2018, Revised Selected Papers. Kochetov, Y., Khachay, M., Evtushenko, Y., Malkova, V., Posypkin, M. & Jacimovic, M. (eds.). Springer, p. 144-154 11 p. (Communications in Computer and Information Science; vol. 974).

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

  2. NP-Hardness of Some Euclidean Problems of Partitioning a Finite Set of Points

    Kel’manov, A. V. & Pyatkin, A. V., 1 May 2018, In: Computational Mathematics and Mathematical Physics. 58, 5, p. 822-826 5 p.

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

  3. NP-Hardness of Some Data Cleaning Problem

    Kutnenko, O. A. & Plyasunov, A. V., Apr 2021, In: Journal of Applied and Industrial Mathematics. 15, 2, p. 285-291 7 p.

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

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

  5. NP-Hardness of balanced minimum sum-of-squares clustering

    Pyatkin, A., Aloise, D. & Mladenović, N., 1 Oct 2017, In: Pattern Recognition Letters. 97, p. 44-45 2 p.

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

  6. NP-Hardness of 1-Mean and 1-Medoid 2-Clustering Problem with Arbitrary Clusters Sizes

    Pyatkin, A. V., 2021, Mathematical Optimization Theory and Operations Research: Recent Trends - 20th International Conference, MOTOR 2021, Revised Selected Papers. Strekalovsky, A., Kochetov, Y., Gruzdeva, T. & Orlov, A. (eds.). Springer, p. 248-256 9 p. (Communications in Computer and Information Science; vol. 1476 CCIS).

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

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

  8. Non-Clairvoyant Makespan Minimization Scheduling with Predictions

    Bampis, E., Кононов, А. В., Lucarelli, G. & Pascual, F., Dec 2023, Leibniz International Proceedings in Informatics, LIPIcs. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 283. 15 p. 9. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 283).

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

  9. Non-canonical maximum cliques without a design structure in the block graphs of 2-designs

    Goryainov, S. & Konstantinova, E. V., Nov 2024, In: Designs, Codes, and Cryptography. 92, 11, p. 3665-3675 11 p.

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

  10. Multi-target Weakly Supervised Regression Using Manifold Regularization and Wasserstein Metric

    Kalmutskiy, K., Cherikbayeva, L., Litvinenko, A. & Berikov, V., 2023, Communications in Computer and Information Science. Springer, p. 364-375 12 p. (Communications in Computer and Information Science; vol. 1881 CCIS).

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

Previous 1...14 15 16 17 18 19 20 21 ...36 Next

ID: 3086997