On clustering to minimize the sum of radii

DOI10.1137/100798144zbMATH Open1286.68497OpenAlexW1975461956MaRDI QIDQ2884573FDOQ2884573

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

Publication date: 30 May 2012

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/100798144

Recommendations

• On Metric Clustering to Minimize the Sum of Radii
• On metric clustering to minimize the sum of radii
• Algorithms – ESA 2005
• On minimum sum of radii and diameters clustering
• The discrete 2-center problem

zbMATH Keywords

\(k\)-clusteringMIN-cost \(k\)-coverminimum sum of radii cover

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cited In (15)

• On Metric Clustering to Minimize the Sum of Radii
• Approximating fair \(k\)-min-sum-radii in Euclidean space
• Algorithms – ESA 2005
• Clustering to minimize the maximum intercluster distance
• Faster algorithms for some optimization problems on collinear points
• Maximizing the sum of radii of disjoint balls or disks
• Average case network lifetime on an interval with adjustable sensing ranges
• A PTAS for the disk cover problem of geometric objects
• Connecting a set of circles with minimum sum of radii
• Fault-tolerant covering problems in metric spaces
• Covering a set of points with a minimum number of equal disks via simulated annealing
• On minimum sum of radii and diameters clustering
• Clustering to minimize the sum of cluster diameters
• Static and Dynamic Algorithms for k-Point Clustering Problems
• On metric clustering to minimize the sum of radii

This page was built for publication: On 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 Q2884573)