Streaming with minimum space: an algorithm for covering by two congruent balls
From MaRDI portal
Publication:393049
DOI10.1016/J.TCS.2013.02.004zbMATH Open1301.68239OpenAlexW2142756768MaRDI QIDQ393049FDOQ393049
Authors: 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
Recommendations
- Streaming with minimum space: an algorithm for covering by two congruent balls
- Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls
- Streaming algorithms for extent problems in high dimensions
- Computing \(k\)-center over streaming data for small \(k\)
- scientific article; zbMATH DE number 6297803
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cites Work
- A near-linear algorithm for the planar 2-center problem
- Title not available (Why is that?)
- Approximating extent measures of points.
- 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
- Title not available (Why is that?)
- Incremental Clustering and Dynamic Information Retrieval
- An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions
- Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
- Title not available (Why is that?)
- More planar two-center algorithms
- Title not available (Why is that?)
- Smaller coresets for \(k\)-median and \(k\)-means clustering
Cited In (7)
- An improved data stream algorithm for clustering
- Two-center of the convex hull of a point set: dynamic model, and restricted streaming model
- Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls
- From approximate balls to approximate ellipses
- The discrete and mixed minimax 2-center problem
- Streaming with minimum space: an algorithm for covering by two congruent balls
- The discrete and mixed minimax 2-center problems
This page was built for publication: Streaming with minimum space: an algorithm for covering by two congruent balls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393049)
