Approximation algorithms for the metric maximum clustering problem with given cluster sizes.
From MaRDI portal
Publication:1811624
DOI10.1016/S0167-6377(02)00235-3zbMath1053.90139MaRDI QIDQ1811624
Refael Hassin, Shlomi Rubinstein
Publication date: 17 June 2003
Published in: Operations Research Letters (Search for Journal in Brave)
90C59: Approximation methods and heuristics in mathematical programming
68W25: Approximation algorithms
Related Items
An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes, Sphere-separable partitions of multi-parameter elements
Cites Work
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- Approximation algorithms for maximum dispersion
- An empirical comparison of heuristic methods for creating maximally diverse groups
- A class of bounded approximation algorithms for graph partitioning
- One-Half Approximation Algorithms for the k-Partition Problem
- Robust Matchings