Facility Location in Dynamic Geometric Data Streams

DOI10.1007/978-3-540-87744-8_55zbMath1158.68547OpenAlexW1532122534MaRDI QIDQ3541125

Christiane Lammersen, Christian Sohler

Publication date: 25 November 2008

Published in: Algorithms - ESA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87744-8_55

zbMATH Keywords

approximationfacility locationdynamic data streams

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (5)

Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Kinetic facility location

Cites Work

• Counting distinct items over update streams
• On coresets for k-means and k-median clustering
• Algorithms for dynamic geometric problems over data streams
• Coresets in dynamic geometric data streams
• On k-Median clustering in high dimensions
• A PTAS for k-means clustering based on weak coresets
• Smaller coresets for k-median and k-means clustering
• Sampling in dynamic data streams and applications
• Memoryless Facility Location in One Pass
• Automata, Languages and Programming

This page was built for publication: Facility Location in Dynamic Geometric Data Streams