On the Complexity of Some Quadratic Euclidean Partition Problems into Balanced Clusters

On the Complexity of Some Quadratic Euclidean Partition Problems into Balanced Clusters Full article

Conference

International Conference on Optimization and Applications
30 Sep - 4 Oct 2019 , Петровац

Journal

Communications in Computer and Information Science
ISSN: 1865-0929

Output data

Year: 2020, Pages: 127-136 Pages count : 10 DOI: 10.1007/978-3-030-38603-0_10

Tags

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

Authors

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

Affiliations

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

DB	Citing
OpenAlex	1