Probabilistic counting algorithms for data base applications
Journal of Computer and System Sciences
Optimal algorithms for approximate clustering
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A deterministic linear time algorithm for geometric separators and its applications
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
The space complexity of approximating the frequency moments
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Separators for sphere-packings and nearest neighbor graphs
Journal of the ACM (JACM)
Incremental clustering and dynamic information retrieval
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximate clustering via core-sets
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Clustering Data Streams: Theory and Practice
IEEE Transactions on Knowledge and Data Engineering
Better streaming algorithms for clustering problems
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Streaming-Data Algorithms for High-Quality Clustering
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Discrete & Computational Geometry
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
| Hi-index | 0.00 |
We study approximation streaming algorithms for the k- center problem in the fixed dimensional Euclidean space. Given an integer k ≥ 1 and a set S of n points in the d-dimensional Euclidean space, the k-center problem is to cover those points in S with k congruent balls with the smallest possible radius. For any Ɛ 0, we devise an O( k/Ɛd)-space (1 + Ɛ)-approximation streaming algorithm for the k- center problem, and prove that the updating time of the algorithm is O(k/Ɛd log k) + 2O(k1-1/d/Ɛd). On the other hand, we prove that any (1 + Ɛ)- approximation streaming algorithm for the k-center problem must use Ω(k/Ɛ(d-1)/2)-bits memory. Our approximation streaming algorithm is obtained by first designing an off-line (1+Ɛ)-approximation algorithm with O(n log k) + 2O(k1-1/d/Ɛd) time complexity, and then applying this off-line algorithm repeatedly to a sketch of the input data stream. If Ɛ is fixed, our off-line algorithm improves the best-known off-line approximation algorithm for the k-center problem by Agarwal and Procopiuc [1] that has O(n log k) + (k/Ɛ)O(k1-1/d) time complexity. Our approximate streaming algorithm for the k-center problem is different from another streaming algorithm by Har-Peled [16], which maintains a core set of size O(k/Ɛd), but does not provide approximate solution for small Ɛ 0.