On minimum sum of radii and diameters clustering

DOI10.1007/978-3-642-31155-0_7MaRDI QIDQ2904544zbMATH OpenOpenAlexFDO

Authors Babak Behsaz, Mohammad Salavatipour

Publication date 14 August 2012

Published in Algorithm Theory – SWAT 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31155-0_7

zbMATH Keywords

clusteringEuclidean distancediameters clusteringminimum sum radii

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Recommendations

• On minimum sum of radii and diameters clustering
• On Metric Clustering to Minimize the Sum of Radii
• On metric clustering to minimize the sum of radii
• Clustering to minimize the sum of cluster diameters
• Approximation algorithms for clustering to minimize the sum of diameters

Cited in

(10)

• On Metric Clustering to Minimize the Sum of Radii
• Clustering to minimize the sum of cluster diameters
• Algorithms – ESA 2005
• On clustering to minimize the sum of radii
• Minimum-diameter covering problems
• Minimum sum of diameters clustering
• Clustering to minimize the sum of cluster diameters
• On metric clustering to minimize the sum of radii
• Minimum adjusted Rand index for two clusterings of a given size
• Resolving conflicts for lower-bounded 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 Q2904544)