On the Complexity of Approximation Streaming Algorithms for the k-Center Problem

DOI10.1007/978-3-540-73814-5_15MaRDI QIDQ3612586zbMATH OpenOpenAlexFDO

Authors Mahdi Abdelguerfi, Zhi-Xiang Chen, Bin Fu

Publication date 10 March 2009

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73814-5_15

Mathematics Subject Classification ID

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

Recommendations

• Computing \(k\)-center over streaming data for small \(k\)
• An improved data stream algorithm for clustering
• Computing k centers over streaming data for small k
• A streaming algorithm for 2-center with outliers in high dimensions
• An improved data stream algorithm for clustering

Cited in

(7)

• Computing k centers over streaming data for small k
• Computing \(k\)-center over streaming data for small \(k\)
• An improved data stream algorithm for clustering
• (1 + )-approximation for facility location in data streams
• Tight lower bounds for approximate \& exact \(k\)-center in \(\mathbb{R}^d\)
• A streaming algorithm for 2-center with outliers in high dimensions
• An improved data stream algorithm for clustering

This page was built for publication: On the Complexity of Approximation Streaming Algorithms for the k-Center Problem

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