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}
}
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
FPT Approximation for Constrained Metric k-Median/Means
Streaming PTAS for Binary $\ell_0$-Low Rank Approximation

References

SHOWING 1-10 OF 38 REFERENCES
Stability Yields a PTAS for k-Median and k-Means Clustering
On coresets for k-means and k-median clustering
Faster Algorithms for the Constrained k-means Problem
A PTAS for k-means clustering based on weak coresets
...
1
2
3
4
...