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

Polynomial-Time Approximation Algorithm for the Problem of Cardinality-Weighted Variance-Based 2-Clustering with a Given Center Научная публикация

Журнал

Computational Mathematics and Mathematical Physics
ISSN: 0965-5425 , E-ISSN: 1555-6662

Вых. Данные

Год: 2018, Том: 58, Номер: 1, Страницы: 130-136 Страниц : 7 DOI: 10.1134/s0965542518010074

Авторы

Kel’manov A.V. ^1,2 , Motkova A.V. ^1,2

Организации

1	Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, 630090 Russia
2	Novosibirsk State University, Novosibirsk, 630090 Russia

Kel’manov A.V. , Motkova A.V.
Polynomial-Time Approximation Algorithm for the Problem of Cardinality-Weighted Variance-Based 2-Clustering with a Given Center
Computational Mathematics and Mathematical Physics. 2018. V.58. N1. P.130-136. DOI: 10.1134/s0965542518010074 WOS Scopus OpenAlex

Web of science:	WOS:000426674100009
Scopus:	2-s2.0-85042701688
OpenAlex:	W2793344488

БД	Цитирований
OpenAlex	8
Scopus	8
Web of science	5