Computing k-center over streaming data for small k

DOI10.1007/978-3-642-35261-4_9MaRDI QIDQ4909522zbMATH OpenOpenAlexFDO

Authors Hee-Kap Ahn, Hyo-Sil Kim, Sang-Sub Kim, Wanbin Son

Publication date 21 March 2013

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-35261-4_9

Mathematics Subject Classification ID

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

Recommendations

• Computing \(k\) centers over streaming data for small \(k\)
• An improved data stream algorithm for clustering
• On the Complexity of Approximation Streaming Algorithms for the k-Center Problem
• Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls
• An improved data stream algorithm for clustering

Cited in

(9)

• An improved data stream algorithm for clustering
• Streaming with minimum space: an algorithm for covering by two congruent balls
• An improved data stream algorithm for clustering
• Computing \(k\) centers over streaming data for small \(k\)
• On the Complexity of Approximation Streaming Algorithms for the k-Center Problem
• A streaming algorithm for 2-center with outliers in high dimensions
• Streaming with minimum space: an algorithm for covering by two congruent balls
• Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
• An adaptive probabilistic algorithm for online \(k\)-center clustering

This page was built for publication: Computing \(k\)-center over streaming data for small \(k\)

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