Finding almost-satisfying assignments
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On weighted vs unweighted versions of combinatorial optimizationproblems
Information and Computation
Some optimal inapproximability results
Journal of the ACM (JACM)
On the power of unique 2-prover 1-round games
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The Approximability of Constraint Satisfaction Problems
SIAM Journal on Computing
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Near-optimal algorithms for unique games
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?
SIAM Journal on Computing
Optimal algorithms and inapproximability results for every CSP?
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Near-optimal algorithms for maximum constraint satisfaction problems
ACM Transactions on Algorithms (TALG)
Hard constraint satisfaction problems have hard gaps at location 1
Theoretical Computer Science
Combination Can Be Hard: Approximability of the Unique Coverage Problem
SIAM Journal on Computing
Constraint Satisfaction Problems of Bounded Width
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
The complexity of making unique choices: approximating 1-in-k SAT
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Survey: Colouring, constraint satisfaction, and complexity
Computer Science Review
Linear programming, width-1 CSPs, and robust satisfaction
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Robust satisfiability of constraint satisfaction problems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
We study the approximability of two natural Boolean constraint satisfaction problems: Horn satisfiability and exact hitting set. Under the Unique Games conjecture, we prove the following optimal inapproximability and approximability results for finding an assignment satisfying as many constraints as possible given a near-satisfiable instance. 1. Given an instance of Max Horn-3SAT that admits an assignment satisfying (1 − ε) of its constraints for some small constant ε 0, it is hard to find an assignment satisfying more than (1−1/O(log(1/ε))) of the constraints. This matches a linear programming based algorithm due to Zwick [Zwi98], resolving the natural open question raised in that work concerning the optimality of the approximation bound. Given a (1 − ε) satisfiable instance of Max Horn-2SAT for some constant ε 0, it is possible to find a (1−2ε)-satisfying assignment efficiently. This improves the algorithm given in [KSTW00] which finds a (1−3ε)-satisfying assignment, and also matches the (1 − cε) hardness for any c 2. An instance of Max 1-in-k-HS consists of a universe U and a collection C of subsets of U of size at most k, and the goal is to find a subset of U that intersects the maximum number of sets in C at a unique element. We prove that Max 1-in-k-HS is hard to approximate within a factor of O(1/log k) for every fixed integer k. This matches (up to constant factors) an easy factor Ω(1/log k) approximation algorithm for the problem, and resolves a question posed in [GT05]. It is crucial for the above hardness that sets of size up to k are allowed; indeed, when all sets have size k, there is a simple factor 1/e-approximation algorithm. Our hardness results are proved by constructing integrality gap instances for a semidefinite programming relaxation for the problems, and using Raghavendra's result [Rag08] to conclude that no algorithm can do better than the SDP assuming the UGC. In contrast to previous gap constructions where the instances had a good SDP solution by design and the main task was bounding the integral optimum, the challenge in our case is the construction of appropriate SDP vectors and the integral optimum is easy to bound. Our algorithmic results are based on rounding appropriate linear programming relaxations.