Exact and approximation algorithms for clustering

Algorithmica (New York)

Volumn 33, Issue 2, 2002, Pages 201-226

  Agarwal, P K ^a   Procopiuc, C M ^a  

^a Duke University   (United States)

Author keywords

Approximation algorithms; Capacitated clustering; K Center clustering

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; DYNAMIC PROGRAMMING; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

CAPACITATED CLUSTERING;

COMPUTER SCIENCE;

EID: 0042956736     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0110-y     Document Type: Article

References (34)

1. P. K. Agarwal and M. Sharir, Efficient algorithms for geometric optimization, ACM Comput. Surv., 30 (1998), 412-458.
2. R. Agrawal, A. Ghosh, T. Imielinski, B. Iyer, and A. Swami, An interval classifier for database mining applications, Proc. 18th Internat. Conf. Very Large Databases, Morgan Kauffman, San Mateo, CA, August 1992, pp. 560-573.
3. M. R. Anderberg, Cluster Analysis for Applications, Academic Press, New York, 1973.
4. S. Arora, Polynomial time approximation schemes for Euclidean TSP and other geometric problems, Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci., 1996, pp. 2-11.
5. S. Arora, Nearly linear time approximation schemes for Euclidean TSP and other geometric problems, Proc. 38th Annu. IEEE Sympos. Found. Comput. Sci., 1997, pp. 554-563.
6. S. Arora, P. Raghavan, and S. Rao, Approximation schemes for Euclidean k-median and related problems, Proc. 30th Annu. ACM Sympos. Theory Comput., 1998, pp. 106-113.
7. V. Arya, N. Garg, R. Khanderkar, A. Meyerson, K. Munagala, and V. Pandit, Local search heuristics for k-median and facility location problems, Proc 33rd Annu. ACM Sympos. Theory Comput., 2001, pp. 21-29.
8. J. Bar-Ilan, G. Kortsarz, and D. Peleg, How to allocate network centers, J. Algorithms, 15 (1993), 385-415.
9. M. Berger and I. Rigoutsos, An algorithm for point clustering and grid generation, IEEE Trans. Systems Man Cybernet., 21 (1991), 1278-1286.
10. M. Charikar, C. Chekuri, T. Feder, and R. Motwani, Incremental clustering and dynamic information retrieval, Proc. 29th Annu. ACM Sympos. Theory Comput., 1997, pp. 626-635.
11. D. R. Cutting, D. R. Karger, and J. O. Pedersen, Constant interaction-time scatter/gather browsing of very large document collections, Proc. 16th Annu. Internat. ACM SIGIR Conf. Res. Devel. Inform. Retrieval, 1993, pp. 126-134.
12. D. R. Cutting, D. R. Karger, J. O. Pedersen, and J. W. Tukey, Scatter/gather: a cluster-based approach to browsing large document collections, Proc. 16th Annu. Internat. ACM SIGIR Conf. Res. Devel. Inform. Retrieval, 1992, pp. 318-329.
13. A. A. Diwan, S. Rane, S. Seshadri, and S. Sudarshan, Clustering techniques for minimizing external path length, Proc. 22nd Internat. Conf. Very Large Databases, Morgan Kauffman, San Mateo, CA, 1996, pp. 342-353.
14. Z. Drezner, The p-centre problems - heuristic and optimal algorithms, J. Oper. Res. Soc., 35 (1984), 741-748.
15. Z. Drezner (ed.), Facility Location, Springer-Verlag, New York, 1995.
16. T. Feder and D. H. Greene, Optimal algorithms for approximate clustering, Proc. 20th Annu. ACM Sympos. Theory Comput., 1988, pp. 434-444.
17. R. J. Fowler, M. S. Paterson, and S. L. Tanimoto, Optimal packing and covering in the plane are NP-complete, Inform. Process. Lett., 12 (1981), 133-137.
18. T. Gonzalez, Clustering to minimize the maximum intercluster distance, Theoret. Comput. Sci., 38 (1985), 293-306.
19. T. Gonzalez, Covering a set of points in multidimensional space, Inform. Process. Lett., 40 (1991), 181-188.
20. R. Z. Hwang, R. C. Chang, and R. C. T. Lee, The generalized searching over separators strategy to solve some NP-hard problems in subexponential time, Algorithmica, 9 (1993), 398-123.
21. R. Z. Hwang, R. C. T. Lee, and R. C. Chang, The slab dividing approach to solve the Euclidean p-center problem, Algorithmica, 9 (1993), 1-22.
22. A. K. Jain and R. C. Dubes, Algorithms for Clustering Data, Prentice-Hall, Englewood Cliffs, NJ, 1988.
23. K. Jain and V. V. Vazirani, Primal-dual approximation algorithms for metric facility location and k-median problems, Proc. 40th Annu. Sympos. Found. Comput. Sci., 1999, pp. 2-13.
24. J. Jolion, P. Meer, and S. Batauche, Robust clustering with applications in computer vision, IEEE Trans. Pattern Anal. Mach. Intell., 13 (1991), 791-802.
25. L. Kaufman and P. J. Rousseeuw, Finding Groups in Data: An Introduction to Cluster Analysis, Wiley, New York, 1990.
26. S. Khuller and Y. J. Sussmann, The capacitated k-center problem, Proc. 4th Annu. European Sympos. Algorithms, Lecture Notes in Computer Science, Vol. 1136, Springer-Verlag, Berlin, 1996, pp. 152-166.
27. R. Lupton, F. M. Maley, and N. Young, Data collection for the sloan digital sky survey: a network-flow heuristic, Proc. 7th Annu. ACM-SIAM Sympos. Discrete Algorithms, 1996, pp. 296-303.
28. J. Makhoul, S. Roucos, and H. Gish, Vector quantization in speech coding, Proc. IEEE, 73 (1985), 1551-1588.
29. N. Megiddo and K. J. Supowit, On the complexity of some common geometric location problems, SIAM J. Comput., 13 (1984), 182-196.
30. R. T. Ng and J. Han, Efficient and effective clustering methods for spatial data mining, Proc. 20th Internat. Conf. Very Large Databases, 1994, pp. 144-155.
31. P. Raghavan, Information retrieval algorithms: a survey, Proc. 18th ACM-SIAM Sympos. Discrete Algorithms, 1997, pp. 11-18.
32. P. Schroeter and J. Bigün, Hierarchical image segmentation by multi-dimensional clustering and orientation-adaptive boundary refinement, Pattern Recognition, 28 (1995), 695-709.
33. J. Shafer, R. Agrawal, and M. Mehta, Sprint: a scalable parallel classifier for data mining, Proc. 22nd Internat. Conf. Very Large Databases, Morgan Kauffman, San Mateo, CA, 1996, pp. 544-555.
34. D. Shmoys, E. Tardos, and K. Aardel, Approximation algorithms for facility location problems, Proc. 29th Annu. ACM Sympos. Theory Comput., 1997, pp. 265-274.