Exact and approximation algorithms for clustering
type: Item
instance of: scholarly article
title: Exact and approximation algorithms for clustering
zbMATH Open document ID: 0994.68178
published in: Algorithmica
publication date: 2002-06-17T00:00:00Z
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1756782
zbMATH Keywords: \(k\)-center problem
author: Pankaj K. Agarwal
author: Cecilia M. Procopiuc
MaRDI profile type: Publication
full work available at URL: s00453-001-0110-y
OpenAlex ID: W3137423196
DOI: 10.1007/S00453-001-0110-Y
Recommended article: Q4250235
Recommended article: Approximation schemes for clustering problems
Recommended article: Q2729096
Recommended article: Q3115255
Recommended article: Q5214247
Recommended article: Q4797555
Recommended article: APPROXIMATE ALGORITHMS FOR GRAPH CLUSTERING PROBLEM
Recommended article: Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers
Recommended article: Efficient approximation algorithms for clustering point-sets
description: scientific article; zbMATH DE number 1756782