Improved Approximation Algorithms for MAX SAT.
Takao AsanoDavid P. WilliamsonPublished in: J. Algorithms (2002)
Keyphrases
- approximation algorithms
- max sat
- exact algorithms
- np hard
- lower bound
- branch and bound algorithm
- weighted max sat
- special case
- worst case
- vertex cover
- sat solvers
- search algorithm
- branch and bound
- constant factor
- linear programming
- randomized algorithms
- approximation ratio
- primal dual
- sat problem
- constant factor approximation
- np complete
- orders of magnitude
- satisfiability problem
- tabu search
- disjoint paths
- optimal solution
- constraint satisfaction
- phase transition
- boolean satisfiability
- first order logic
- upper bound