Computational complexity of the problem of choosing typical representatives in a 2-clustering of a finite set of points in a metric space (Q5090149)
From MaRDI portal
scientific article; zbMATH DE number 7558112
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity of the problem of choosing typical representatives in a 2-clustering of a finite set of points in a metric space |
scientific article; zbMATH DE number 7558112 |
Statements
Computational complexity of the problem of choosing typical representatives in a 2-clustering of a finite set of points in a metric space (English)
0 references
15 July 2022
0 references
NP-hard problem
0 references
typical representative
0 references
rival similarity
0 references
\(p\)-median problem
0 references
data mining
0 references
