An approximation polynomial-time algorithm for a cardinality-weighted 2-clustering problem | Sciact - Система учета научной деятельности ИМ СО РАН

An approximation polynomial-time algorithm for a cardinality-weighted 2-clustering problem Научная публикация

Сборник

2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON)
Сборник, 2017.

Вых. Данные

Год: 2017, Страницы: 94-96 Страниц : 3 DOI: 10.1109/sibircon.2017.8109845

Авторы

Kel'manov Alexander ^1,2 , Motkova Anna ^1,2

Организации

1	Sobolev Institute of Mathematics
2	Novosibirsk State University

Kel'manov A. , Motkova A.
An approximation polynomial-time algorithm for a cardinality-weighted 2-clustering problem
В сборнике 2017 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON). 2017. – C.94-96. DOI: 10.1109/sibircon.2017.8109845 OpenAlex

OpenAlex:

W2769754130

Пока нет цитирований