Abstract
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 ℓ ) ℓ − ε . 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
