Clustering to minimize the sum of cluster diameters

DOI10.1145/380752.380753zbMath1323.68428OpenAlexW2054464090MaRDI QIDQ5175947

Rina Panigrahy, Moses Charikar

Publication date: 27 February 2015

Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/380752.380753

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Approximation algorithms (68W25)

Related Items (3)

On minimum sum of radii and diameters clustering ⋮ Incremental algorithms for facility location and \(k\)-median ⋮ Approximation algorithms for hierarchical location problems

Cites Work

• A constant-factor approximation algorithm for the k -median problem (extended abstract)

This page was built for publication: Clustering to minimize the sum of cluster diameters