Efficient approximation algorithms for clustering point-sets
From MaRDI portal
Publication:733558
DOI10.1016/j.comgeo.2007.12.002zbMath1181.62098OpenAlexW1970303631MaRDI QIDQ733558
Publication date: 16 October 2009
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2007.12.002
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Improved separated red-blue center clustering ⋮ A unified framework for clustering constrained data without locality property
Cites Work
- Approximation algorithms for a \(k\)-line center
- Clustering to minimize the maximum intercluster distance
- An O(n log n) algorithm for the all-nearest-neighbors problem
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximate clustering via core-sets
- On coresets for k-means and k-median clustering
- Algorithms for coloring quadtrees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Efficient approximation algorithms for clustering point-sets
