Better Streaming Algorithms for Clustering Problems (2003)
Cached
Download Links
- [www.cs.princeton.edu]
- [www.madalgo.au.dk]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proc. of 35th ACM Symposium on Theory of Computing (STOC |
| Citations: | 63 - 1 self |
BibTeX
@INPROCEEDINGS{Charikar03betterstreaming,
author = {Moses Charikar and Liadan O'Callaghan and Rina Panigrahy},
title = {Better Streaming Algorithms for Clustering Problems},
booktitle = {In Proc. of 35th ACM Symposium on Theory of Computing (STOC},
year = {2003},
pages = {30--39}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We study cluster ng pr blems in the str aming model, wher e the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storSD space.Our mainr esult is a r ndomized algor ithm for k--Median prE lem which p duces a constant factor appr oximation in one pass using storR4 space O(kpolylog n). This is a significant imp r vement of the prS ious best algor5 hm which yielded a 2 appr ximation using O(n )space.
