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

2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence Full article

Journal

Lecture Notes in Computer Science
ISSN: 0302-9743 , E-ISSN: 1611-3349

Output data

Year: 2020, Pages: 386-393 Pages count : 8 DOI: 10.1007/978-3-030-40616-5_34

Authors

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

Affiliations

1	Sobolev Institute of Mathematics, 4 Koptyug Avenue, 630090 Novosibirsk, Russia
2	Novosibirsk State University, 2 Pirogova Street, 630090 Novosibirsk, Russia

Kel’manov A. , Khamidullin S. , Panasenko A.
2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence
Lecture Notes in Computer Science. 2020. P.386-393. DOI: 10.1007/978-3-030-40616-5_34 Scopus OpenAlex

Scopus:	2-s2.0-85080879437
OpenAlex:	W3006185228

DB	Citing
OpenAlex	2
Scopus	2