Computational Complexity of the Problem of Choosing Typical Representatives in a 2-Clustering of a Finite Set of Points in a Metric Space

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	242-248
Number of pages	7
Journal	Journal of Applied and Industrial Mathematics
Volume	14
Issue number	2
DOIs	https://doi.org/10.1134/S1990478920020039
Publication status	Published - 1 May 2020

data mining, NP-hard problem, p-median problem, rival similarity, typical representative

ID: 24769429