Simultaneous Approximation of Constraint Satisfaction Problems
Electronic Colloquium on Computational Complexity (ECCC), 2014.
Given $k$ collections of 2SAT clauses on the same set of variables $V$, can we find one assignment that satisfies a large fraction of clauses from each collection? We consider such simultaneous constraint satisfaction problems, and design the first nontrivial approximation algorithms in this context. Our main result is that for every ...More
PPT (Upload PPT)