Motivated by recent works on streaming algorithms for constraint satisfaction problems
(CSPs), we define and analyze oblivious algorithms for the Max-$ k $ AND problem. This …

We give an O(n)-space single-pass 0.483-approximation streaming algorithm for estimating
the maximum directed cut size (Max-DICUT) in a directed graph on n vertices. This improves …

An ordering constraint satisfaction problem (OCSP) is defined by a family $\mathcal {F} $ of
predicates mapping permutations on $\{1,\ldots, k\} $ to $\{0, 1\} $. An instance of Max-OCSP …

In this survey we describe progress over the last decade or so in understanding the
complexity of solving constraint satisfaction problems (CSPs) approximately in the streaming …

A constraint satisfaction problem (CSP),, is specified by a finite set of constraints for positive
integers q and k. An instance of the problem on n variables is given by m applications of …

We explore the use of local algorithms in the design of streaming algorithms for the
Maximum Directed Cut problem. Specifically, building on the local algorithm of (Buchbinder …

Abstract Maximum Constraint satisfaction problems (Max-CSPs) are ubiquitous in computer
science and encompass optimization problems such as Max-CUT, Max-DICUT, Max-kSAT …

An ordering constraint satisfaction problem (OCSP) is defined by a family F of predicates
mapping permutations on {1,…, k} to {0, 1}. An instance of Max-OCSP (F) on n variables …