Sublinear-time approximation for clustering via random sampling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3142, Issue , 2004, Pages 396-407

  Czumaj, Artur ^a   Sohler, Christian ^b  

^a University Heights   (United States)

^b UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; SAMPLING; SET THEORY; TOPOLOGY;

CLUSTERING PROBLEMS; METRIC SPACES; RANDOM SAMPLING; SIMPLE SAMPLINGS; SMALL SAMPLES; SUBLINEAR TIME; SUBLINEAR TIME ALGORITHMS; TECHNICAL CONTRIBUTION;

CLUSTERING ALGORITHMS;

EID: 35048875680     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_35     Document Type: Article

References (23)

1. S. Arora, P. Raghavan, and S. Rao. Approximation schemes for Euclidean k-medians and related problems. 30th STOC, pp. 106-113, 1998.
2. V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit. Local search heuristics for k-median and facility location problems. 33rd STOC, pp. 21-30, 2001.
3. Y. Bartal, M. Charikar, and D. Raz. Approximating min-sum k-clustering in metric spaces. 33rd STOC, pp. 11-20, 2001.
4. M. Charikar and S. Guba. Improved combinatorial algorithms for the facility location and k-median problems. 40th FOCS, pp. 378-388, 1999.
5. M. Charikar, S. Guha, É. Tardos, and D. B. Shmoys. A constant-factor approximation algorithm for the k-median problem. 31st STOC, pp. 1-10, 1999.
6. M. Charikar, S. Khuller, D. M. Mount, and G. Narasimhan. Algorithms for facility location problems with outliers. 12th SODA, pp. 642-651, 2001.
7. M. Charikar, L. O'Callaghan, and R. Panigrahy. Better streaming algorithms for clustering problems. 35th STOC, pp. 30-39, 2003.
8. B. Chazelle. Who says you have to look at the input? The brave new world of sublinear computing? 15th SODA, p. 134, 2004.
9. W. Fernandez de la Vega, M. Karpinski, C. Kenyon, and Y. Rabani. Polynomial time approximation schemes for metric min-sum clustering. 35th STOC, pp. 50-58, 2003.
10. N. Gutmann-Beck and R. Hassin. Approximation algorithms for min-sum p-clustering. Discrete Applied Mathematics, 89:125-142, 1998.
11. S. Har-Peled and S. Mazumdar. Coresets for k-means and k-median clustering and their applications. 36th STOC, 2004.
12. P. Indyk. Sublinear time algorithms for metric space problems. 31st STOC, pp. 428-434, 1999.
13. P. Indyk. A sublinear time approximation scheme for clustering in metric spaces. 40th FOCS, pp. 154-159, 1999.
14. K. Jain, M. Mahdian, and A. Saberi. A new greedy approach for facility location problems. 34th STOC, pp. 731-740, 2002.
15. K. Jain and V. V. Vazirani. Primal-dual approximation algorithms for metric facility location and k-median problems. 40th FOCS, pp. 2-13, 1999.
16. S. G. Kolliopoulos and S. Rao. A nearly linear-time approximation scheme for the Euclidean k-median problems. 7th ESA, pp. 378-389, 1999.
17. R. Kumar and R Rubinfeld. Sublinear time algorithms. SIGACT News, 34(4):57-67, 2003.
18. R. R. Mettu and C. G. Plaxton. Optimal time bounds for approximate clustering. 18th Conference on Uncertainty in Artificial Intelligence (UAI), pp. 344-351, August 2002.
19. A. Meyerson, L. O'Callaghan, and S. Plotkin. A k-median algorithm with running time independent of data size. Journal of Machine Learning, 2004.
20. N. Mishra, D. Oblinger, and L. Pitt. Sublinear time approximate clustering. 12th SODA, pp. 439-447, 2001.
21. L. J. Schulman. Clustering for edge-cost minimization. 32nd STOC, pp. 547-555, 2000.
22. S. Sahni and T. Gonzalez. P-complete approximation problems. JACM, 23:555-566, 1976.
23. T. Tokuyama, and J. Nakano. Geometric algorithms for the minimum cost assignment problem. Random Structures and Algorithms, 6(4): 393-406, 1995.