On the Complexity of Some Quadratic Euclidean Partition Problems into Balanced Clusters | Sciact - Система учета научной деятельности ИМ СО РАН

On the Complexity of Some Quadratic Euclidean Partition Problems into Balanced Clusters Научная публикация

Конференция

International Conference on Optimization and Applications
30 сент. - 4 окт. 2019 , Петровац

Журнал

Communications in Computer and Information Science
ISSN: 1865-0929

Вых. Данные

Год: 2020, Страницы: 127-136 Страниц : 10 DOI: 10.1007/978-3-030-38603-0_10

Ключевые слова

Balanced partition; Euclidean space; Normalized by the cluster size; NP-completeness; Quadratic variance; Sized-weighted

Авторы

Kel’manov Alexander ^1,2 , Khandeev Vladimir ^1,2 , Pyatkin Artem ^1,2

Организации

1	Sobolev Institute of Mathematics
2	Novosibirsk State University

Kel’manov A. , Khandeev V. , Pyatkin A.
On the Complexity of Some Quadratic Euclidean Partition Problems into Balanced Clusters
Communications in Computer and Information Science. 2020. P.127-136. DOI: 10.1007/978-3-030-38603-0_10 Scopus OpenAlex

Scopus:	2-s2.0-85078452712
OpenAlex:	W2999397289

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