Approximate clustering via core-sets. (English) Zbl 1192.68871
Proceedings of the thirty-fourth annual ACM symposium on theory of computing (STOC 2002), Montreal, Quebec, Canada, May 19–21, 2002. New York, NY: ACM Press (ISBN 1-581-13495-9). 250-257, electronic only (2002).
For the entire collection see [Zbl 1074.68502].
References:
| [1] | P. Agarwal and C. Procopiuc. Exact and approximation algorithms for clustering. In Proc. 9th ACM-SIAM Sympos. Discrete Algorithms, pages 658-667, 1998. · Zbl 0930.68168 |
| [2] | N. Alon, S. Dar, M. Parnas, and D. Ron. Testing of clustering. In Proc. 41th Annu. IEEE Sympos. Found. Comput. Sci., 2000. |
| [3] | S. Arora, P. Raghavan, and S. Rao. Approximation schemes for Euclidean k-median and related problems. In Proc. 30th Annu. ACM Sympos. Theory Comput., pages 106-113, 1998. 10.1145/276698.276718 · Zbl 1027.68979 |
| [4] | M. Bern and D. Eppstein. Approximation algorithms for geometric problems. In D. Hochbaum, editor, Approximationg algorithms for NP-Hard problems. PWS Publishing Company, 1997. |
| [5] | R. Duda, P. Hart, and D. Stork. Pattern Classification. Wiley-Interscience, New York, 2nd edition, 2001. · Zbl 0968.68140 |
| [6] | L. Engebretsen, P. Indyk, and R. O’Donnell. Derandomized dimensionality reduction with applications. In Proc. 13th ACM-SIAM Sympos. Discrete Algorithms, 2002. to appear. · Zbl 1093.68668 |
| [7] | A. Goel, P. Indyk, and K. Varadarajan. Reductions among high dimensional proximity problems. In Proc. 12th ACM-SIAM Sympos. Discrete Algorithms, pages 769-778, 2001. · Zbl 0988.65022 |
| [8] | T. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoret. Comput. Sci., 38:293-306, 1985. · Zbl 0567.62048 |
| [9] | M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics. Springer-Verlag, Berlin Heidelberg, 2nd edition, 1988. 2nd edition 1994. · Zbl 0634.05001 |
| [10] | S. Har-Peled. Clustering motion. In Proc. 42nd Annu. IEEE Sympos. Found. Comput. Sci., pages 84-93, 2001. |
| [11] | S. Har-Peled and K. Varadarajan. Approximate shape fitting via linearization. In Proc. 42nd Annu. IEEE Sympos. Found. Comput. Sci., pages 66-73, 2001. |
| [12] | P. Indyk. Algorithmic applications of low-distortion geometric embeddings. In Proc. 42nd Annu. IEEE Sympos. Found. Comput. Sci., pages 10-31, 2001. Tutorial. |
| [13] | P. Indyk and M. Thorup. Approximate 1-median. manuscript, 2000. |
| [14] | N. Mishra, D. Oblinger, and L. Pitt. Sublinear time approximate clustering. In SODA 12, 2001. · Zbl 0987.68068 |
| [15] | R. Ostrovsky and Y. Rabani. Polynomial time approximation schemes for geometric k-clustering. In Proc. 41st Symp. Foundations of Computer Science, pages 349-358. IEEE, Nov 2000. |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
