Adding cardinality constraints to integer programs with applications to maximum satisfiability

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):398

• Type: Journal
• Year: 2008
• Where: IPL
• Authors: Markus Bläser, Thomas Heynen, Bodo Manthey
• Keywords: Algorithms, Approximation Algorithms, Approximation Ratio, IPL 2008