Streaming PTAS for Binary ℓ_0-Low Rank Approximation

09/25/2019

∙

by   Anup Bhattacharya, et al.

∙

0

∙

share

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 ℓ_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.