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

Information Processing Letters

Volumn 98, Issue 3, 2006, Pages 92-95

  Hassin, Refael ^a   Rubinstein, Shlomi ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximation algorithms; Maximum weight clustering

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY;

APPROXIMATION ALGORITHMS; CLUSTER SIZE; METRIC MAXIMUM CLUSTERING;

MATRIX ALGEBRA;

EID: 33644585232     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.12.002     Document Type: Article

References (6)

1. T. Feo, O. Goldschmidt, and M. Khellaf One half approximation algorithms for the k-partition problem Oper. Res. 40 1992 S170 S172
2. T. Feo, and M. Khellaf A class of bounded approximation algorithms for graph partitioning Networks 20 1990 181 195
3. R. Hassin, and S. Rubinstein Robust matchings SIAM J. Discrete Math. 15 2002 530 537
4. R. Hassin, and S. Rubinstein Approximation algorithms for the metric maximum clustering problem with given cluster sizes Oper. Res. Lett. 31 2003 179 184
5. R. Hassin, and S. Rubinstein An approximation algorithm for maximum triangle packing Proc. ESA 2004 Lecture Notes in Comput. Sci. vol. 3221 2004 Springer Berlin 395 402
6. R. Hassin, S. Rubinstein, and A. Tamir Approximation algorithms for maximum dispersion Oper. Res. Lett. 21 1997 133 137