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 proceedingConference contributionResearchpeer-review

Previous 1...85 86 87 88 89 Next

ID: 3086502