Approximation algorithms for the metric maximum clustering problem with given cluster sizes.

DOI10.1016/S0167-6377(02)00235-3zbMath1053.90139OpenAlexW1972843861MaRDI QIDQ1811624

Refael Hassin, Shlomi Rubinstein

Publication date: 17 June 2003

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(02)00235-3

zbMATH Keywords

Approximation algorithmsMaximum clustering

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (2)

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

This page was built for publication: Approximation algorithms for the metric maximum clustering problem with given cluster sizes.