On approximate geometric k-clustering

Discrete and Computational Geometry

Volumn 24, Issue 1, 2000, Pages 61-84

  Matousek J ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034417244     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004540010019     Document Type: Article

References (12)

1. S. Arora. Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In Proc. 37th Annu. IEEE Sympos. Found. Comput. Sci., pages 2-11, 1996.
2. S. Arora, P. Raghavan, and S. Rao. Polynomial time approximation schemes for the Euclidean k-medians problem. In Proc. 30th Annu. ACM Sympos. Theory Comput., pages 106-113, 1998.
3. S. Arya, G. Das, D. M. Mount, J. S. Salowe, and M. Smid. Euclidean spanners: Short, thin, and lanky. In Proc. 27th Annu. ACM Sympos. Theory Comput., pages 489-498, 1995.
4. S. Arya and D. Mount. Approximate range searching. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 172-181, 1995.
5. P. B. Callahan and S. R. Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. Assoc. Comput. Mach., 42:67-90, 1995.
6. V. Capoyleas, G. Rote, and G. Woeginger. Geometric clusterings. J. Algorithms, 12:341-356, 1991.
7. S. Hasegawa, H. Imai, M. Inaba, N. Katoh, and J. Nakano. Efficient algorithms for variance-based k-clustering. In Proc. First Pacific Conf. Comput. Graphics Appl., Seoul, Korea, vol. 1, pages 75-89. World Scientific, Singapore, 1993.
8. M. Inaba, N. Katoh, and H. Imai. Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 332-339, 1994.
9. P. Indyk. A sublinear-time approximation scheme for clustering in metric spaces. In Proc. 40th IEEE Sympos. Found. Comput. Sci., 1999.
10. P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proc. 30th Annu. ACM Sympos. Theory Comput., pages 604-613, 1998.
11. S. Kolliopoulos and S. Rao. A nearly linear-time approximation scheme for the Euclidean k-median problem. In Proc. 7th Annu. Europ. Sympos. Algorithms, pages 378-387. Lecture Notes in Computer Science 1643, Springer-Verlag, Berlin, 1999.
12. K. Varadarajan. Private communication, May 1999.