NP-Completeness of Some Problems of Partitioning a Finite Set of Points in Euclidean Space into Balanced Clusters

NP-Completeness of Some Problems of Partitioning a Finite Set of Points in Euclidean Space into Balanced Clusters Full article

Journal

Doklady Mathematics
ISSN: 1064-5624 , E-ISSN: 1531-8362

Output data

Year: 2019, Volume: 100, Number: 2, Pages: 416-419 Pages count : 4 DOI: 10.1134/s1064562419050028

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.
NP-Completeness of Some Problems of Partitioning a Finite Set of Points in Euclidean Space into Balanced Clusters
Doklady Mathematics. 2019. V.100. N2. P.416-419. DOI: 10.1134/s1064562419050028 WOS Scopus OpenAlex

Web of science:	WOS:000496709100003
Scopus:	2-s2.0-85075150257
OpenAlex:	W2986153947

DB	Citing
Scopus	1
OpenAlex	1
Web of science	1