On minimum sum of radii and diameters clustering
From MaRDI portal
Publication:494937
DOI10.1007/s00453-014-9907-3zbMath1319.68251OpenAlexW2040008390MaRDI QIDQ494937
Babak Behsaz, Mohammad R. Salavatipour
Publication date: 3 September 2015
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.4429
Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items
Unnamed Item, Dynamic clustering to minimize the sum of radii, Dynamic Sum-Radii Clustering, Unnamed Item, Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Minimum sum of diameters clustering
- On metric clustering to minimize the sum of radii
- Clustering to minimize the sum of cluster diameters
- Metric entropy of some classes of sets with differentiable boundaries
- On Clustering to Minimize the Sum of Radii
- Geometric clusterings
- On Metric Clustering to Minimize the Sum of Radii
- A Best Possible Heuristic for the k-Center Problem
- Clustering to minimize the sum of cluster diameters