Better streaming algorithms for clustering problems

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 30-39

  Charikar, Moses ^a   O'Callaghan, Liadan ^b   Panigrahy, Rina ^c  

^a PRINCETON UNIVERSITY   (United States)

^b STANFORD UNIVERSITY   (United States)

^c NONE

Author keywords

Clustering; K median; Streaming algorithm

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA STORAGE EQUIPMENT; RANDOM PROCESSES;

STREAMING ALGORITHMS;

DATA STRUCTURES;

EID: 0038447051     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780547.780548     Document Type: Conference Paper

References (34)

1. M. Ajtai, T. S. Jayram, R. Kumar, and D. Sivakumar Approximate counting of inversions in a data stream. Proc. 34th STOC, 2002.
2. N. Alon, S. Dar, M. Parnas and D. Ron. Testing of clustering. Proc. 41st FOCS, 2000.
3. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. JCSS 58(1): 1999.
4. S. Arora, P. Raghavan, and S. Rao. Approximation schemes for Euclidean k-median and related problems. Proc. STOC, 1998.
5. V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit. Local search heuristics for k-median and facility location problems. Proc. STOC, 2001.
6. Z. Bar-Yossef, S. R. Kumar, and D. Sivakumar. Reductions in streaming algorithms, with an application to counting triangles in graphs. Proc. SODA, 2002.
7. M. Charikar, C. Chekuri, T. Feder, and R. Motwani. Incremental clustering and dynamic information retrieval. Proc. STOC, 1997.
8. M. Charikar and S. Guha. Improved combinatorial algorithms for the facility location and k-Median problems. Proc. FOCS, 1999.
9. M. Charikar, S. Guha, E. Tardos, and D. Shmoys. A constant factor approximation algorithm for the k-Median problem. Proc. STOC, 1999.
10. M. Charikar, S. Khuller, D. M. Mount, and G. Narasimhan. Algorithms for facility location problems with outliers. Proc. SODA 2001.
11. M. Charikar and R. Panigrahy. Clustering to minimize the sum of cluster diameters. Proc. STOC, 2001.
12. M. Dyer and A. M. Frieze. A simple heuristic for the p-center problem. Operations Research Letters, v. 3, 1985.
13. J. Feigenbaum, S. Kannan, M. Strauss, and M. Viswanathan. An approximate L1-difference algorithm for massive data streams. Proc. FOCS, 2000.
14. A. C. Gilbert, S. Guha, P. Indyk, Y. Kotidis, S. Muthukrishnan, and M. J. Strauss. Fast, small-space algorithms for approximate histogram maintenance. Proc. STOC, 2002.
15. S. Guha, N. Koudas, and K. Shim. Data-streams and histograms. Proc. STOC, 2001.
16. S. Guha, N. Mishra, R. Motwani, and L. O'Callaghan Clustering data streams. Proc. FOCS, 2000.
17. O. Kariv and S. L. Hakimi. An algorithmic approach to network location problems, part ii: p-medians. SIAM Journal of Appl. Math, v. 37, 1979.
18. M. Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. In DIMACS series in Discrete Mathematics and Theoretical Computer Science, v. 50, 1999.
19. D. S. Hochbaum and D. B. Shmoys. A best possible approximation algorithm for the k-Center problem. Mathematics of Operations Research, v. 10, 1985.
20. P. Indyk. Sublinear time algorithms for metric space roblems. Proc. STOC, 1999.
21. P. Indyk. A sublinear time approximation scheme for clustering in metric spaces. Proc. FOCS, 1999.
22. P. Indyk. Stable distributions, pseudorandom generators, embeddings and data stream computation. Proc. FOCS, 2000.
23. K. Jain and V. Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual scheme and Lagrangian relaxation. Journal of the ACM, v. 48, 2001.
24. M. Korupolu, C. G. Plaxton, and R. Rajaraman. Analysis of a local search heuristic for facility location problems. Proc. SODA, 1998.
25. J.-H. Lin and J. S. Vitter. Approximation algorithms for geometric median problems. Information Processing Letters, v. 44, 1992.
26. J.-H. Lin and J. S. Vitter. ∈-approximations with minimum packing constraint violation. Proc. STOC, 1992.
27. G. S. Manku, S. Rajagopalan, B. G. Lindsay. Random sampling techniques for space efficient online computation of order statistics of large datasets. Proc. SIGMOD Conference, 1999.
28. R. Mettu and C. G. Plaxton. The online median problem. Proc. FOCS, 2000.
29. R. Mettu and C. G. Plaxton. Optimal time bounds for approximate clustering. Proc. UAI, 2002.
30. A. Meyerson. Online facility location. Proc. FOCS, 2001.
31. A. Meyerson, L. O'Callaghan and S. Plotkin. Approximating k-Median: A sampling-based approach. Unpublished manuscript, 2001.
32. N. Mishra, D. Oblinger and L. Pitt. Sublinear time approximate clustering. Proc. SODA, 2001.
33. M. Thorup. Quick k-median, k-center, and facility location for sparse graphs. Proc. ICALP, 2001.
34. N. E. Young. K-medians, facility location, and the Chernoff-Wald bound. In Proc. SODA, 2000.