Complexity of Some Problems of Quadratic Partitioning of a Finite Set of Points in Euclidean Space into Balanced Clusters

Complexity of Some Problems of Quadratic Partitioning of a Finite Set of Points in Euclidean Space into Balanced Clusters Full article

Journal

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

Output data

Year: 2020, Volume: 60, Number: 1, Pages: 163-170 Pages count : 8 DOI: 10.1134/s096554251911006x

Tags

balanced partition; Euclidean space; NP-completeness; quadratic variance; size-weighted variance; variance normalized by the cluster size

Authors

Kel’manov A.V. ^1,2 , Pyatkin A.V. ^1,2 , Khandeev V.I. ^1,2

Affiliations

1	Sobolev Institute of Mathematics
2	Novosibirsk State University

Kel’manov A.V. , Pyatkin A.V. , Khandeev V.I.
Complexity of Some Problems of Quadratic Partitioning of a Finite Set of Points in Euclidean Space into Balanced Clusters
Computational Mathematics and Mathematical Physics. 2020. V.60. N1. P.163-170. DOI: 10.1134/s096554251911006x WOS Scopus OpenAlex

Web of science:	WOS:000521749800016
Scopus:	2-s2.0-85082601642
OpenAlex:	W3014008886

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