On minimum sum of radii and diameters clustering
From MaRDI portal
(Redirected from Publication:494937)
Recommendations
Cites work
- scientific article; zbMATH DE number 1617263 (Why is no real title available?)
- A Best Possible Heuristic for the k-Center Problem
- Approximation algorithms for clustering to minimize the sum of diameters
- Clustering to minimize the sum of cluster diameters
- Clustering to minimize the sum of cluster diameters
- Geometric clusterings
- Metric entropy of some classes of sets with differentiable boundaries
- Minimum sum of diameters clustering
- On Metric Clustering to Minimize the Sum of Radii
- On clustering to minimize the sum of radii
- 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
- scientific article; zbMATH DE number 7651201 (Why is no real title available?)
- Dynamic clustering to minimize the sum of radii
- Dynamic sum-radii clustering
- Minimum sum of diameters clustering
- Approximation schemes for min-sum \(k\)-clustering
- Clustering to minimize the sum of cluster diameters
- Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints
- On metric clustering to minimize the sum of radii
- Minimum adjusted Rand index for two clusterings of a given size
- 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)