2-Approximation polynomial-time algorithm for a cardinality-weighted 2-partitioning problem of a sequence - Conference attendances

2-Approximation polynomial-time algorithm for a cardinality-weighted 2-partitioning problem of a sequence Conference attendances

Language

Английский

Participant type

Секционный

Conference

The 3rd International Conference and Summer School Numerical Computations: Theory and Algorithms, NUMTA2019
15-21 Jun 2019 , Crotone

Authors

Panasenko Anna ^1,2 , Kel'manov Alexander ^1,2 , Khamidullin Sergey ¹

Affiliations

1	Sobolev Institute of Mathematics
2	Novosibirsk State University

Panasenko A. , Kel'manov A. , Khamidullin S.
2-Approximation polynomial-time algorithm for a cardinality-weighted 2-partitioning problem of a sequence
The 3rd International Conference and Summer School Numerical Computations: Theory and Algorithms, NUMTA2019 15-21 Jun 2019