Corpus ID: 202583423

# Streaming PTAS for Constrained k-Means

@article{Goyal2019StreamingPF,
title={Streaming PTAS for Constrained k-Means},
author={Dishant Goyal and Ragesh Jaiswal and Amit Kumar},
journal={ArXiv},
year={2019},
volume={abs/1909.07511}
}
• Dishant Goyal, Amit Kumar
• Published 2019
• Mathematics, Computer Science
• ArXiv
We generalise the results of Bhattacharya et al. (Journal of Computing Systems, 62(1):93-115, 2018) for the list-$k$-means problem defined as -- for a (unknown) partition $X_1, ..., X_k$ of the dataset $X \subseteq \mathbb{R}^d$, find a list of $k$-center sets (each element in the list is a set of $k$ centers) such that at least one of $k$-center sets $\{c_1, ..., c_k\}$ in the list gives an $(1+\varepsilon)$-approximation with respect to the cost function \$\min_{\textrm{permutation } \pi… Expand
2 Citations

#### References

SHOWING 1-10 OF 38 REFERENCES
Stability Yields a PTAS for k-Median and k-Means Clustering
• Mathematics, Computer Science
• 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
• 2010
On coresets for k-means and k-median clustering
• Mathematics, Computer Science
• STOC '04
• 2004
Faster Algorithms for the Constrained k-means Problem
• Mathematics, Computer Science
• Theory of Computing Systems
• 2017
Streaming k-means on well-clusterable data
• Computer Science, Mathematics
• SODA '11
• 2011
The Hardness of Approximation of Euclidean k-Means
• Computer Science, Mathematics
• SoCG
• 2015
A PTAS for k-means clustering based on weak coresets
• Computer Science, Mathematics
• SCG '07
• 2007