Faster Algorithms for the Constrained k-means Problem
Authors:
- 6 November 2017
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 62 (1) , 93-115
Abstract
No abstract availableKeywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Improved analysis of -sampling based PTAS for k-means and other clustering problemsInformation Processing Letters, 2015
- A Unified Framework for Clustering Constrained Data without Locality Property2014
- A Simple D 2-Sampling Based PTAS for k-Means and Other Clustering ProblemsAlgorithmica, 2013
- Clustering for metric and nonmetric distance measuresACM Transactions on Algorithms, 2010
- A PTAS for k-means clustering based on weak coresets2007
- On k-Median clustering in high dimensions2006
- On coresets for k-means and k-median clustering2004
- Approximation schemes for clustering problems2003
- Approximate clustering via core-sets2002
- Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering1994