Approximate clustering via core-sets

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 250-257

  Bǎdoiu, Mihai ^a   Har Peled, Sariel ^a   Indyk, Piotr ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; OPTIMIZATION; PROBABILITY; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

APPROXIMATION ALGORITHMS; CLUSTERING; CORE-SETS;

ALGORITHMS;

EID: 0036036832     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Exact and approximation algorithms for clustering
2. Testing of clustering
3. Approximation schemes for Euclidean k-median and related problems
4. Approximation algorithms for geometric problems
5. Derandomized dimensionality reduction with applications
6. Reductions among high dimensional proximity problems
7. Clustering to minimize the maximum intercluster distance
8. Clustering motion
9. Approximate shape fitting via linearization
10. Algorithmic applications of low-distortion geometric embeddings
11. Approximate 1-median
12. Sublinear time approximate clustering
13. Polynomial time approximation schemes for geometric k-clustering