Better streaming algorithms for clustering problems
- 9 June 2003
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Fast, small-space algorithms for approximate histogram maintenancePublished by Association for Computing Machinery (ACM) ,2002
- Approximate counting of inversions in a data streamPublished by Association for Computing Machinery (ACM) ,2002
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxationJournal of the ACM, 2001
- Random sampling techniques for space efficient online computation of order statistics of large datasetsPublished by Association for Computing Machinery (ACM) ,1999
- Sublinear time algorithms for metric space problemsPublished by Association for Computing Machinery (ACM) ,1999
- The Space Complexity of Approximating the Frequency MomentsJournal of Computer and System Sciences, 1999
- Approximation schemes for Euclidean k-medians and related problemsPublished by Association for Computing Machinery (ACM) ,1998
- Approximation algorithms for geometric median problemsInformation Processing Letters, 1992
- e-approximations with minimum packing constraint violation (extended abstract)Published by Association for Computing Machinery (ACM) ,1992
- A simple heuristic for the p-centre problemOperations Research Letters, 1985