2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Alexander Kel'manov, Sergey A. Khamidullin, Anna Panasenko. 2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence. In Yaroslav D. Sergeyev, Dmitri E. Kvasov, editors, Numerical Computations: Theory and Algorithms - Third International Conference, NUMTA 2019, Crotone, Italy, June 15-21, 2019, Revised Selected Papers, Part II. Volume 11974 of Lecture Notes in Computer Science, pages 386-393, Springer, 2019. [doi]

This author has not been identified. Look up 'Alexander Kel'manov' in GoogleThis author has not been identified. Look up 'Sergey A. Khamidullin' in GoogleThis author has not been identified. Look up 'Anna Panasenko' in Google

runs on WebDSL