1-mean and 1-medoid 2-clustering problem with arbitrary cluster sizes: Complexity and approximation

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

Original language	English
Pages (from-to)	59-69
Number of pages	11
Journal	Yugoslav Journal of Operations Research
Volume	33
Issue number	1
DOIs	https://doi.org/10.2298/YJOR211018008P
Publication status	Published - 2023

2-approximation algorithm, 2-clustering, Euclidean space, mean, medoid, strong NP-hardness

ID: 56398412