Algorithms for dynamic geometric problems over data streams

DOI10.1145/1007352.1007413MaRDI QIDQ3580982zbMATHOpenAlexFDO

Authors 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)

Cited in

(14)

• No-collision transportation maps
• Streaming Embeddings with Slack
• Streaming Euclidean MST to a constant factor
• Streaming Euclidean \textsc{Max-Cut}: dimension vs data reduction
• Streaming algorithms with one-sided estimation
• scientific article; zbMATH DE number 7378709 (Why is no real title available?)
• scientific article; zbMATH DE number 7053292 (Why is no real title available?)
• Facility Location in Dynamic Geometric Data Streams
• Small space representations for metric min-sum \(k\)-clustering and their applications
• scientific article; zbMATH DE number 7053290 (Why is no real title available?)
• Kinetic facility location
• Dynamic coresets
• On low-risk heavy hitters and sparse recovery schemes
• Online facility location with deletions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580982)