- Article
Fast Approximate ℓ-Center Clustering in High-Dimensional Spaces
- Mirosław Kowaluk,
- Andrzej Lingas and
- Mia Persson
We study the design of efficient approximation algorithms for the ℓ-center clustering and minimum-diameter ℓ-clustering problems in high-dimensional Euclidean and Hamming spaces. Our main tool is randomized dimension reduction. First, we...

