Algorithms for dynamic geometric problems over data streams

DOI10.1145/1007352.1007413zbMATH Open1192.68179OpenAlexW2118224498MaRDI QIDQ3580982FDOQ3580982

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)

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

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)