Efficient approximation algorithms for clustering point-sets

Computational Geometry: Theory and Applications

Volumn 43, Issue 1, 2010, Pages 59-66

  Xu, Guang ^a   Xu, Jinhui ^a  

^a UNIVERSITY AT BUFFALO   (United States)

Author keywords

Clustering; Core sets; K center clustering; K median clustering; Point sets

Indexed keywords

EID: 84867974454     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2007.12.002     Document Type: Conference Paper

References (19)

1. P.K. Agarwal, C.M. Procopiuc, Exact and approximation algorithms for clustering, in: Proc. 9th ACM-SIAM Sympos. Discrete Algorithms, 1998, pp. 658-667
2. P.K. Agarwal, C.M. Procopiuc, and K. Varadarajan Algorithms for a k-line center Algorithmica 42 3-4 2005 221 230
3. M. Badoiu, K.L. Clarkson, Smaller core-sets for balls, in: Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 2003, pp. 801-802
4. M. Badoiu, S. Har-Peled, P. Indyk, Approximate clustering via core-sets, in: Proceedings of the 34th ACM Symposium on Theory of Computing, 2002, pp. 250-257
5. M. Bern, and D. Eppstein Approximation algorithms for geometric problems D.S. Hochbaum, Approximation Algorithms for NP-Hard Problems 1997 PWS Publishing Company
6. R.O. Duda, P.E. Hart, and D.G. Stork Pattern Classification second ed. 2001 Wiley-Interscience New York
7. D. Eppstein, Faster construction of planar two-centers, in: Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, 1997
8. T. Feder, D.H. Greene, Optimal algorithm for approximation clustering, in: Proc. 20th ACM Symp. Theory of Computing, 1988, pp. 434-444
9. J. Han, and M. Kamber Data Mining 2000 Morgan Kaufmann Publishers
10. A. Goel, P. Indyk, K.R. Varadarajan, Reductions among high dimensional proximity problems, in: Proc. 12th ACM-SIAM Sympos. Discrete Algorithms, 2001, pp. 769-778
11. T. Gonzalez Clustering to minimize the maximum intercluster distance Theoretical Computer Science 38 1985 293 306
12. M. Grötschel, L. Lovász, and A. Schrijver Geometric Algorithms and Combinatorial Optimization second ed. Algorithm and Combinatorics vol. 2 1994 Springer-Verlag Berlin, Heidelberg
13. S. Har-Peled, S. Mazumdar, Coresets for k-means and k-median clustering and their applications, in: Proc. 36th ACM Symposium on Theory of Computing, 2004, pp. 291-300
14. D.S. Hochbaum Approximation Algorithms for NP-Hard Problems 1995 PWS
15. A.K. Jain, M.N. Murty, and P.J. Flynn Data clustering: A review ACM Computing Surveys 31 1999 264 323
16. S.G. Kolliopoulos, S. Rao, A nearly linear-time approximation scheme for the Euclidean k-median problem, in: Proc. 7th Annu. European Sympos. Algorithms, 1999, pp. 378-389
17. P. Vaidya An O (nlogn) algorithm for the all-nearest-neighbors problem Discrete and Computational Geometry 4 1989 101 115
18. V.V. Vazirani Approximation Algorithms 2001 Springer
19. X. Wei, J. Samarabandu, R.S. Devdhar, A.J. Siegel, R. Acharya, and R. Berezney Segregation of transcription and replication sites into higher order domains Sciences 281 1998 1502 1506