Coresets in dynamic geometric data streams
From MaRDI portal
Publication:3581392
DOI10.1145/1060590.1060622zbMath1192.68360MaRDI QIDQ3581392
Christian Sohler, Gereon Frahling
Publication date: 16 August 2010
Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1060590.1060622
Related Items
Sublinear-time Algorithms, A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems, An almost space-optimal streaming algorithm for coresets in fixed dimensions, Dynamic coresets, Small space representations for metric min-sum \(k\)-clustering and their applications, Probabilistic \(k\)-median clustering in data streams, Algorithms for k-median Clustering over Distributed Streams, Streaming Embeddings with Slack, Sublinear‐time approximation algorithms for clustering via random sampling, Facility Location in Dynamic Geometric Data Streams, An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions