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)
Some optimal inapproximability results
Journal of the ACM (JACM)
Improved approximation algorithms for MAX SAT
Journal of Algorithms
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
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)
Parameterized Complexity
Adding cardinality constraints to integer programs with applications to maximum satisfiability
Information Processing Letters
On the complexity of global constraint satisfaction
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
| Hi-index | 0.00 |
The optimization problem Max-2SAT-CC is Max-2SAT with the additional cardinality constraint that the value one may be assigned to at most K variables. We present an approximation algorithm with polynomial running time for Max-2SAT-CC. This algorithm achieves, for any 驴 0, approximation ratio 6 + 3 驴 e/16 + 2 驴 e - 驴 驴 0.6603. Furthermore, we present a greedy algorithm with running time O(N log N) and approximation ratio 1/2. The latter algorithm even works for clauses of arbitrary length.