Approximation algorithms for the metric maximum clustering problem with given cluster sizes.
type: Item
instance of: scholarly article
title: Approximation algorithms for the metric maximum clustering problem with given cluster sizes.
zbMATH Open document ID: 1053.90139
DOI: 10.1016/S0167-6377(02)00235-3
author: Refael Hassin
author: Shlomi Rubinstein
published in: Operations Research Letters
publication date: 2003-06-17T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 1929382
zbMATH Keywords: Approximation algorithms
zbMATH Keywords: Maximum clustering
MaRDI profile type: Publication
cites work: One-Half Approximation Algorithms for the k-Partition Problem
cites work: A class of bounded approximation algorithms for graph partitioning
cites work: Robust Matchings
cites work: Approximation algorithms for maximum dispersion
cites work: Probabilistic construction of deterministic algorithms: approximating packing integer programs
cites work: An empirical comparison of heuristic methods for creating maximally diverse groups
full work available at URL: s0167-6377(02)00235-3
OpenAlex ID: W1972843861
Recommended article: An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes
Recommended article: Q4250235
Recommended article: Approximation schemes for clustering problems
Recommended article: Q3115255
Recommended article: Exact and approximation algorithms for clustering
Recommended article: Approximation algorithms for clustering to minimize the sum of diameters
Recommended article: Q2721983
Recommended article: Q2729096
Recommended article: Approximating min-sum k -clustering in metric spaces
description: scientific article; zbMATH DE number 1929382