T. Kanungo, D. Mount, N. Netanyahu, C. Piatko, R. Silverman, and A. Wu. A local search approximation algorithm for k-means clustering. Comput. Geom., 28:89--112, 2004. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Local Search Heuristics for k-median and Facility.. - Arya, Garg.. (2002) (29 citations) (Correct)
....search procedure has a locality gap of exactly 3. For k median, Korupolu et al. 14, 15] gave a local search procedure which permitted adding, deleting and swapping facilities and gave a solution with k(1 ) having a service cost at most 3 5= times the optimum k median solution. Kanungo et al. [9] give a 9 approximation by local search for the k means problem in Euclidean metric. A di erent approach to facility location was employed by Shmoys et al. 16] and Charikar et al. 17] They formulated the problems as linear programs and rounded the optimum fractional solution to obtain a 3 ....
T. Kanungo, D. Mount, N. Netanyahu, C. Piatko, R. Silverman, and A. Wu. A local search approximation algorithm for k-means clustering. In Proceedings of the 18th Annual ACM Symposium on Computational Geometry, pages 10-18, 2002.
The Effectiveness of Lloyd-Type Methods for the k-Means.. - Rafail Ostrovsky Rafail (Correct)
No context found.
T. Kanungo, D. Mount, N. Netanyahu, C. Piatko, R. Silverman, and A. Wu. A local search approximation algorithm for k-means clustering. Comput. Geom., 28:89--112, 2004.
Coresets for k-Means and k-Median Clustering and their.. - Har-Peled, Mazumdar (2003) (Correct)
No context found.
T. Kanungo, D. .M. Mount, N. S. Netanyahu, C. D. Piatko, R. Silverman, and A. Y. Wu. A local search approximation algorithm for k-means clustering. In Proc. 18th Annu. ACM Sympos. Comput. Geom., pages 10-18, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC