The Minimum Satisfiability Problem
SIAM Journal on Discrete Mathematics
On approximation algorithms for the minimum satisfiability problem
Information Processing Letters
Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Derandomizing Approximation Algorithms Based on Semidefinite Programming
SIAM Journal on Computing
Gadgets, Approximation, and Linear Programming
SIAM Journal on Computing
Approximating a generalization of MAX 2SAT and MIN 2SAT
Discrete Applied Mathematics - Special issue on Boolean functions and related problems
Some optimal inapproximability results
Journal of the ACM (JACM)
The importance of being biased
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computer assisted proof of optimal approximability results
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
On Some Tighter Inapproximability Results (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Instant recognition of polynominal time solvability, half integrality and 2-approximations
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
63-Approximation Algorithm for MAX DICUT
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
A Polynomial Time Approximation Scheme for Dense MIN 2SAT
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
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)
On dependent randomized rounding algorithms
Operations Research Letters
Minimum common string partition problem: hardness and approximations
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
| Hi-index | 0.00 |
We obtain substantially improved approximation algorithms for the MIN k-SAT problem, for k = 2, 3. More specifically, we obtain a 1.1037- approximation algorithm for the MIN 2-SAT problem, improving a previous 1.5- approximation algorithm, and a 1.2136-approximation algorithm for the MIN 3- SAT problem, improving a previous 1.75-approximation algorithm for the problem. These results are obtained by adapting techniques that were previously used to obtain approximation algorithms for the MAX k-SAT problem. We also obtain some hardness of approximation results.