An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes
type: Item
instance of: scholarly article
title: An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes
zbMATH Open document ID: 1187.68709
author: Refael Hassin
author: Shlomi Rubinstein
published in: Information Processing Letters
publication date: 2010-01-18T00:00:00Z
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5659908
zbMATH Keywords: approximation algorithms
zbMATH Keywords: maximum weight clustering
MaRDI profile type: Publication
full work available at URL: j.ipl.2005.12.002
OpenAlex ID: W2020242761
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 the metric maximum clustering problem with given cluster sizes.
cites work: Algorithms – ESA 2004
cites work: Approximation algorithms for maximum dispersion
DOI: 10.1016/J.IPL.2005.12.002
Recommended article: Approximation algorithms for the metric maximum clustering problem with given cluster sizes.
Recommended article: Improved Approximations for the Max k-Colored Clustering Problem
Recommended article: Q3115255
Recommended article: Q4250235
Recommended article: Constant-factor approximation algorithms for some maximin multi-clustering problems
Recommended article: Approximation schemes for clustering problems
Recommended article: Exact and approximation algorithms for clustering
Recommended article: Approximating min-sum k -clustering in metric spaces
Recommended article: Approximation algorithms for clustering to minimize the sum of diameters
description: scientific article; zbMATH DE number 5659908