2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence | Sciact - Система учета научной деятельности ИМ СО РАН

2-Approximation Polynomial-Time Algorithm for a Cardinality-Weighted 2-Partitioning Problem of a Sequence Научная публикация

Журнал

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

Вых. Данные

Год: 2020, Страницы: 386-393 Страниц : 8 DOI: 10.1007/978-3-030-40616-5_34

Авторы

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

Организации

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

БД	Цитирований
OpenAlex	2
Scopus	2