A streaming algorithm for 2-center with outliers in high dimensions

DOI10.1016/j.comgeo.2016.07.002zbMath1395.68307OpenAlexW2431755278MaRDI QIDQ680151

Behnam Hatami, Hamid Zarrabi-Zadeh

Publication date: 22 January 2018

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2016.07.002

zbMATH Keywords

outlierdata streamhigh dimensions\(k\)-center

Mathematics Subject Classification ID

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

Related Items (3)

Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions ⋮ On the complexity of some problems of searching for a family of disjoint clusters ⋮ Small Space Stream Summary for Matroid Center

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
• An almost space-optimal streaming algorithm for coresets in fixed dimensions
• An improved data stream algorithm for clustering
• Clustering to minimize the maximum intercluster distance
• Optimal packing and covering in the plane are NP-complete
• On geometric optimization with few violated constraints
• More planar two-center algorithms
• An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
• Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
• A space-optimal data-stream algorithm for coresets in the plane
• On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension

This page was built for publication: A streaming algorithm for 2-center with outliers in high dimensions