On Clustering to Minimize the Sum of Radii

DOI10.1137/100798144zbMath1286.68497OpenAlexW1975461956MaRDI QIDQ2884573

Imran A. Pirwani, Gaurav Kanade, Matthew R. Gibson, Kasturi R. Varadarajan, Erik A. Krohn

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

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)

Related Items (4)

Fault-tolerant covering problems in metric spaces ⋮ A PTAS for the disk cover problem of geometric objects ⋮ On minimum sum of radii and diameters clustering ⋮ Average case network lifetime on an interval with adjustable sensing ranges

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