COMPUTING k CENTERS OVER STREAMING DATA FOR SMALL k
From MaRDI portal
Publication:2939917
DOI10.1142/S0218195914500058zbMath1319.68225OpenAlexW4234153766MaRDI QIDQ2939917
Sang-Sub Kim, Wanbin Son, Hyo-Sil Kim, Hee-Kap Ahn
Publication date: 23 January 2015
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195914500058
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items
An improved data stream algorithm for clustering ⋮ Covering convex polygons by two congruent disks ⋮ Distance Domination in Graphs ⋮ Covering convex polygons by two congruent disks
Cites Work
- An almost space-optimal streaming algorithm for coresets in fixed dimensions
- Clustering to minimize the maximum intercluster distance
- Exact and approximation algorithms for clustering
- More planar two-center algorithms
- Adaptive sampling for geometric problems over data streams
- Faster core-set constructions and data-stream algorithms in fixed dimensions
- On the complexity of some geometric problems in unbounded dimension
- Approximating extent measures of points
- On the Complexity of Some Common Geometric Location Problems
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
- Incremental Clustering and Dynamic Information Retrieval