NP-Hardness of 1-Mean and 1-Medoid 2-Clustering Problem with Arbitrary Clusters Sizes Full article
| Conference |
Mathematical optimization theory and operations research (MOTOR-2021) 05-10 Jul 2021 , Иркутск |
||||
|---|---|---|---|---|---|
| Journal |
Communications in Computer and Information Science
ISSN: 1865-0929 |
||||
| Output data | Year: 2021, Pages: 248-256 Pages count : 9 DOI: 10.1007/978-3-030-86433-0_17 | ||||
| Tags | 2-clustering; Euclidean space; Mean; Medoid; Strong NP-hardness | ||||
| Authors |
|
||||
| Affiliations |
|
Cite:
Pyatkin A.V.
NP-Hardness of 1-Mean and 1-Medoid 2-Clustering Problem with Arbitrary Clusters Sizes
Communications in Computer and Information Science. 2021. P.248-256. DOI: 10.1007/978-3-030-86433-0_17 Scopus OpenAlex
NP-Hardness of 1-Mean and 1-Medoid 2-Clustering Problem with Arbitrary Clusters Sizes
Communications in Computer and Information Science. 2021. P.248-256. DOI: 10.1007/978-3-030-86433-0_17 Scopus OpenAlex
Identifiers:
| Scopus: | 2-s2.0-85115847034 |
| OpenAlex: | W3201462009 |