On minimum sum of radii and diameters clustering
From MaRDI portal
Publication:494937
DOI10.1007/S00453-014-9907-3zbMATH Open1319.68251OpenAlexW2040008390MaRDI QIDQ494937FDOQ494937
Authors: Babak Behsaz, Mohammad 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
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Cites Work
- A Best Possible Heuristic for the k-Center Problem
- 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
- Approximation algorithms for clustering to minimize the sum of diameters
- Title not available (Why is that?)
- On clustering to minimize the sum of radii
- Geometric clusterings
- Clustering to minimize the sum of cluster diameters
- Minimum sum of diameters clustering
- On metric clustering to minimize the sum of radii
Cited In (13)
- On Metric Clustering to Minimize the Sum of Radii
- Approximating fair \(k\)-min-sum-radii in Euclidean space
- Title not available (Why is that?)
- Dynamic clustering to minimize the sum of radii
- Dynamic sum-radii clustering
- Approximation schemes for min-sum \(k\)-clustering
- Minimum sum of diameters clustering
- Clustering to minimize the sum of cluster diameters
- Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints
- Minimum adjusted Rand index for two clusterings of a given size
- On metric clustering to minimize the sum of radii
- Dynamic clustering to minimize the sum of radii
- On minimum sum of radii and diameters clustering
This page was built for publication: On minimum sum of radii and diameters clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494937)
