Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity

DOI10.1007/978-3-540-85363-3_14zbMath1159.68672OpenAlexW2127468194MaRDI QIDQ3541794

Samir Khuller, Richard Matthew McCutchen

Publication date: 27 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85363-3_14

zbMATH Keywords

outliersclusteringanonymity\(k\)-centerstreaming

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Approximation algorithms (68W25)

Related Items (15)

Matroid and knapsack center problems ⋮ Streaming with minimum space: an algorithm for covering by two congruent balls ⋮ Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls ⋮ Fully dynamic \(k\)-center clustering with outliers ⋮ On the complexity of some problems of searching for a family of disjoint clusters ⋮ Massively parallel and streaming algorithms for balanced clustering ⋮ Fully dynamic \(k\)-center clustering with outliers ⋮ Unnamed Item ⋮ Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers ⋮ An improved data stream algorithm for clustering ⋮ Small Space Stream Summary for Matroid Center ⋮ A streaming algorithm for 2-center with outliers in high dimensions ⋮ Approximation algorithm for the kinetic robust \(k\)-center problem ⋮ Correlation clustering in data streams ⋮ Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction

This page was built for publication: Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity