Simultaneous Approximation of Constraint Satisfaction Problems

Electronic Colloquium on Computational Complexity (ECCC), 2014.

Cited by: 7|Bibtex|Views15|
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|arxiv.org

Abstract:

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

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments