On Metric Clustering to Minimize the Sum of Radii

DOI10.1007/978-3-540-69903-3_26MaRDI QIDQ3512466zbMATH OpenOpenAlexFDO

Authors Gaurav Kanade, Imran A. Pirwani, Matt Gibson, Erik Krohn, Kasturi Varadarajan

Publication date 15 July 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-69903-3_26

zbMATH Keywords

\(k\)-clustering\(k\)-coverclusteringdoubling metricmetric clusteringplanar metric

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)

Recommendations

• On metric clustering to minimize the sum of radii
• On minimum sum of radii and diameters clustering
• On clustering to minimize the sum of radii
• Clustering to minimize the sum of cluster diameters
• On minimum sum of radii and diameters clustering

Cites work

• A Best Possible Heuristic for the k-Center Problem
• A randomized approximation scheme for metric MAX-CUT
• A tight bound on approximating arbitrary metrics by tree metrics
• Algorithms – ESA 2005
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Approximation algorithms for clustering to minimize the sum of diameters
• Clustering to minimize the sum of cluster diameters
• scientific article; zbMATH DE number 5764795 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 6469222 (Why is no real title available?)
• Minimum-cost coverage of point sets by disks
• Planar Formulae and Their Uses
• Polynomial time approximation schemes for base station coverage with minimum total radii

Cited in

(13)

• Dynamic clustering to minimize the sum of radii
• On clustering to minimize the sum of radii
• On minimum sum of radii and diameters clustering
• The Planar k-Means Problem is NP-Hard
• The planar \(k\)-means problem is NP-hard
• Shifting strategy for geometric graphs without geometry
• Approximate clustering via metric partitioning
• On minimum sum of radii and diameters clustering
• Dynamic clustering to minimize the sum of radii
• Approximating min-sum k -clustering in metric spaces
• Maximizing the sum of radii of disjoint balls or disks
• On metric clustering to minimize the sum of radii
• The structural clustering and analysis of metric based on granular space

This page was built for publication: On Metric Clustering to Minimize the Sum of Radii

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3512466)