361 - 363 out of 363Page size: 10
Sort by: Title

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

  2. 1-mean and 1-medoid 2-clustering problem with arbitrary cluster sizes: Complexity and approximation

    Pyatkin, A. V., 2023, In: Yugoslav Journal of Operations Research. 33, 1, p. 59-69 11 p.

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

  3. 1/2-Approximation polynomial-time algorithm for a problem of searching a subset

    Ageev, A., Kel'Manov, A., Pyatkin, A., Khamidullin, S. & Shenmaier, 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. 8-12 5 p. 8109827. (Proceedings - 2017 International Multi-Conference on Engineering, Computer and Information Sciences, SIBIRCON 2017).

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

Previous 1...33 34 35 36 37 Next

ID: 3086997