An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes

DOI10.1016/j.ipl.2005.12.002zbMath1187.68709OpenAlexW2020242761MaRDI QIDQ844164

Refael Hassin, Shlomi Rubinstein

Publication date: 18 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.12.002

zbMATH Keywords

approximation algorithmsmaximum weight clustering

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Related Items

Approximation algorithms for bounded degree phylogenetic roots

Cites Work

• Approximation algorithms for maximum dispersion
• Approximation algorithms for the metric maximum clustering problem with given cluster sizes.
• A class of bounded approximation algorithms for graph partitioning
• One-Half Approximation Algorithms for the k-Partition Problem
• Robust Matchings
• Algorithms – ESA 2004