A Simple D 2-Sampling Based PTAS for k-Means and other Clustering Problems

DOI10.1007/978-3-642-32241-9_2zbMath1364.68368arXiv1201.4206OpenAlexW1544196046MaRDI QIDQ2914307

Amit Kumar, Ragesh Jaiswal, Sandeep Sen

Publication date: 25 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.4206

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms (68W40) Approximation algorithms (68W25)

Related Items (3)

Preclustering algorithms for imprecise points ⋮ A lower bound for metric 1-median selection ⋮ Metric 1-Median Selection: Query Complexity vs. Approximation Ratio

This page was built for publication: A Simple D 2-Sampling Based PTAS for k-Means and other Clustering Problems