Streaming PTAS for Binary π0-Low Rank Approximation
Lists
Only you see this
Abstract
We give a 3-pass, polylog-space streaming PTAS for the constrained binary $k$-means problem and a 4-pass, polylog-space streaming PTAS for the binary $\ell_0$-low rank approximation problem. The connection between the above two problems has recently been studied. We design a streaming PTAS for the former and use this connection to obtain streaming PTAS for the latter. This is the first constant pass, polylog-space streaming algorithm for either of the two problems.
BibTeX
@misc{bhattacharya2019streaming,
author = {Anup Bhattacharya and Dishant Goyal and Ragesh Jaiswal and Amit Kumar},
title = {{Streaming PTAS for Binary π0-Low Rank Approximation}},
year = {2019},
eprint = {1909.11744},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/1909.11744},
}Loading related content...