Algorithms for dynamic geometric problems over data streams
Author:
Open Access
- 13 June 2004
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 373-380
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- On coresets for k-means and k-median clustering2004
- Estimating the weight of metric minimum spanning trees in sublinear-time2004
- The sensor spectrumACM SIGMOD Record, 2003
- Better streaming algorithms for clustering problems2003
- Fast, small-space algorithms for approximate histogram maintenance2002
- Similarity estimation techniques from rounding algorithms2002
- Local search heuristic for k-median and facility location problems2001
- The space complexity of approximating the frequency moments1996
- Probabilistic counting algorithms for data base applicationsJournal of Computer and System Sciences, 1985
- An analysis of the greedy algorithm for the submodular set covering problemCombinatorica, 1982