NP-Hardness of Quadratic Euclidean 1-Mean and 1-Median 2-Clustering Problem with Constraints on the Cluster Sizes

NP-Hardness of Quadratic Euclidean 1-Mean and 1-Median 2-Clustering Problem with Constraints on the Cluster Sizes Full article

Journal

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

Output data

Year: 2020, Volume: 100, Number: 3, Pages: 545-548 Pages count : 4 DOI: 10.1134/s1064562419060127

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-Hardness of Quadratic Euclidean 1-Mean and 1-Median 2-Clustering Problem with Constraints on the Cluster Sizes
Doklady Mathematics. 2020. V.100. N3. P.545-548. DOI: 10.1134/s1064562419060127 WOS Scopus OpenAlex

Web of science:	WOS:000519350300010
Scopus:	2-s2.0-85081681028
OpenAlex:	W4240963999

DB	Citing
Scopus	6
OpenAlex	5