Streaming with minimum space: an algorithm for covering by two congruent balls

DOI10.1016/j.tcs.2013.02.004zbMath1301.68239OpenAlexW2142756768MaRDI QIDQ393049

Chung Keung Poon, Binhai Zhu

Publication date: 16 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.02.004

zbMATH Keywords

streaming algorithmsapproximation ratiotwo-center covering

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (3)

The Discrete and Mixed Minimax 2-Center Problem ⋮ The discrete and mixed minimax 2-center problems ⋮ An improved data stream algorithm for clustering

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smaller coresets for \(k\)-median and \(k\)-means clustering
• A near-linear algorithm for the planar 2-center problem
• More planar two-center algorithms
• Approximating extent measures of points
• An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions
• Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
• Approximate clustering via core-sets
• On coresets for k-means and k-median clustering
• Incremental Clustering and Dynamic Information Retrieval
• Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions

This page was built for publication: Streaming with minimum space: an algorithm for covering by two congruent balls