Algorithms for dynamic geometric problems over data streams

DOI10.1145/1007352.1007413zbMath1192.68179OpenAlexW2118224498MaRDI QIDQ3580982

Piotr Indyk

Publication date: 15 August 2010

Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1007352.1007413

Mathematics Subject Classification ID

Data structures (68P05) Approximation algorithms (68W25)

Related Items (12)

Dynamic coresets ⋮ Streaming Embeddings with Slack ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Facility Location in Dynamic Geometric Data Streams ⋮ On Low-Risk Heavy Hitters and Sparse Recovery Schemes ⋮ Small space representations for metric min-sum \(k\)-clustering and their applications ⋮ Kinetic facility location ⋮ No-collision transportation maps ⋮ Streaming Algorithms with One-Sided Estimation ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Algorithms for dynamic geometric problems over data streams