Adding cardinality constraints to integer programs with applications to maximum satisfiability

Markus Bläser, Thomas Heynen, Bodo Manthey

Research output: Contribution to journalArticleAcademicpeer-review

3 Citations (Scopus)

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.
Original languageUndefined
Pages (from-to)194-198
Number of pages5
JournalInformation processing letters
Volume105
Issue number5
DOIs
Publication statusPublished - 2008

Keywords

  • EWI-21364
  • Approximation algorithms
  • Cardinality constraints
  • Randomized algorithms
  • IR-79438
  • Satisfiability

Cite this