Improved analysis of D2-sampling based PTAS for k-means and other clustering problems

Information Processing Letters

Volumn 115, Issue 2, 2015, Pages 100-103

  Jaiswal, Ragesh ^a   Kumar, Mehul ^a   Yadav, Pulkit ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

D2 sampling; k Means clustering; PTAS; Randomized algorithms

Indexed keywords

CLUSTERING PROBLEMS; K-MEANS; K-MEANS CLUSTERING; PTAS; RANDOMIZED ALGORITHMS; RUNNING TIME; SAMPLING-BASED;

EID: 84911914209     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2014.07.009     Document Type: Article

References (4)

1. M.R. Ackermann, and J. Blömer Coresets and approximate clustering for Bregman divergences Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms SODA'09 2009 1088 1097
2. M.R. Ackermann, J. Blömer, and C. Sohler Clustering for metric and nonmetric distance measures ACM Trans. Algorithms 6 Sep. 2010 59:1-59:26
3. 2-sampling based PTAS for k-means and other clustering problems Algorithmica 2013
4. A. Kumar, Y. Sabharwal, and S. Sen Linear-time approximation schemes for clustering problems in any dimensions J. ACM 57 2 Feb. 2010 5:1-5:32