On the Minimum Hitting Set of Bundles Problem
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
On the minimum hitting set of bundles problem
Theoretical Computer Science
Approximation algorithms and hardness results for labeled connectivity problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Minimum satisfiability and its applications
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Optimizing with minimum satisfiability
Artificial Intelligence
| 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 approximationresults.