FAST APPROXIMATION ALGORITHMS FOR SOME MAXIMIN CLUSTERING PROBLEMS

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

Original language	English
Pages (from-to)	337-353
Number of pages	17
Journal	Yugoslav Journal of Operations Research
Volume	34
Issue number	2
DOIs	https://doi.org/10.2298/YJOR2023021K
Publication status	Published - 2024

Euclidean space, NP-hardness, approximation algorithm, bounded scatter, clustering, max-min problem

ID: 61310896