New ${\bf \frac{3}{4}}$-Approximation Algorithms for the Maximum Satisfiability Problem
SIAM Journal on Discrete Mathematics
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Efficient approximation of product distributions
Random Structures & Algorithms
Approximation algorithms
Some optimal inapproximability results
Journal of the ACM (JACM)
Improved approximation algorithms for MAX SAT
Journal of Algorithms
Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
A 7/8-Approximation Algorithm for MAX 3SAT?
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Nonuniform Boolean constraint satisfaction problems with cardinality constraint
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.90 |
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of satisfied clauses among all such assignments. If each clause is restricted to have at most @? literals, we obtain the problem Max-@?SAT-CC. Sviridenko [Algorithmica 30 (3) (2001) 398-405] designed a (1-e^-^1)-approximation algorithm for Max-SAT-CC. This result is tight unless P=NP [U. Feige, J. ACM 45 (4) (1998) 634-652]. Sviridenko asked if it is possible to achieve a better approximation ratio in the case of Max-@?SAT-CC. We answer this question in the affirmative by presenting a randomized approximation algorithm whose approximation ratio is 1-(1-1@?)^@?-@e. To do this, we develop a general technique for adding a cardinality constraint to certain integer programs. Our algorithm can be derandomized using pairwise independent random variables with small probability space.