Optimal Streaming Approximations for all Boolean Max-2CSPs

by   Chi-Ning Chou, et al.

We prove tight upper and lower bounds on approximation ratios of all Boolean Max-2CSP problems in the streaming model. Specifically, for every type of Max-2CSP problem, we give an explicit constant α, s.t. for any ϵ>0 (i) there is an (α-ϵ)-streaming approximation using space O(logn); and (ii) any (α+ϵ)-streaming approximation requires space Ω(√(n)). This generalizes the celebrated work of [Kapralov, Khanna, Sudan SODA 2015; Kapralov, Krachun STOC 2019], who showed that the optimal approximation ratio for Max-CUT was 1/2. Prior to this work, the problem of determining this ratio was open for all other Max-2CSPs. Our results are quite surprising for some specific Max-2CSPs. For the Max-DCUT problem, there was a gap between an upper bound of 1/2 and a lower bound of 2/5 [Guruswami, Velingker, Velusamy APPROX 2017]. We show that neither of these bounds is tight, and the optimal ratio for Max-DCUT is 4/9. We also establish that the tight approximation for Max-2SAT is √(2)/2, and for Exact Max-2SAT it is 3/4. As a byproduct, our result gives a separation between space-efficient approximations for Max-2SAT and Exact Max-2SAT. This is in sharp contrast to the setting of polynomial-time algorithms with polynomial space, where the two problems are known to be equally hard to approximate.


page 1

page 2

page 3

page 4


Separating MAX 2-AND, MAX DI-CUT and MAX CUT

Assuming the Unique Games Conjecture (UGC), the best approximation ratio...

The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut

We investigate the space complexity of two graph streaming problems: Max...

Linear Space Streaming Lower Bounds for Approximating CSPs

We consider the approximability of constraint satisfaction problems in t...

An Optimal Space Lower Bound for Approximating MAX-CUT

We consider the problem of estimating the value of MAX-CUT in a graph in...

Oblivious algorithms for the Max-kAND Problem

Motivated by recent works on streaming algorithms for constraint satisfa...

Streaming Euclidean Max-Cut: Dimension vs Data Reduction

Max-Cut is a fundamental problem that has been studied extensively in va...

On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product

In this paper we study the (Bichromatic) Maximum Inner Product Problem (...

Please sign up or login with your details

Forgot password? Click here to reset