Faster algorithms for the constrained \(k\)-means problem
type: Item
instance of: scholarly article
title: Faster algorithms for the constrained \(k\)-means problem
zbMATH Open document ID: 1387.68296
author: Anup Bhattacharya
author: Ragesh Jaiswal
author: Amit Kumar
published in: Theory of Computing Systems
publication date: 2018-03-01T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 62H30
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6845591
zbMATH Keywords: constrained \(k\)-means clustering
zbMATH Keywords: \(D^2\) sampling
MaRDI profile type: Publication
full work available at URL: s00224-017-9820-7
OpenAlex ID: W3021687846
cites work: Clustering for metric and nonmetric distance measures
cites work: Approximate clustering via core-sets
cites work: On k-Median clustering in high dimensions
cites work: Approximation schemes for clustering problems
cites work: A Unified Framework for Clustering Constrained Data without Locality Property
cites work: A PTAS for k-means clustering based on weak coresets
cites work: On coresets for k-means and k-median clustering
cites work: A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems
cites work: Improved analysis of \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems
cites work: Linear-time approximation schemes for clustering problems in any dimensions
cites work: On approximate geometric \(k\)-clustering
DOI: 10.1007/S00224-017-9820-7
description: scientific article; zbMATH DE number 6845591