Improved approximation algorithms for MAX SAT.
Takao AsanoDavid P. WilliamsonPublished in: SODA (2000)
Keyphrases
- approximation algorithms
- max sat
- exact algorithms
- np hard
- lower bound
- vertex cover
- worst case
- special case
- branch and bound algorithm
- weighted max sat
- sat solvers
- sat problem
- search algorithm
- primal dual
- satisfiability problem
- linear programming
- maximum satisfiability
- tabu search
- np complete
- approximation ratio
- randomized algorithms
- constant factor approximation
- branch and bound
- boolean satisfiability
- traveling salesman problem
- constraint satisfaction
- polynomial time approximation
- genetic algorithm