Approximation Algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson.
Takao AsanoPublished in: ISTCS (1997)
Keyphrases
- approximation algorithms
- max sat
- np hard
- weighted max sat
- branch and bound algorithm
- lower bound
- special case
- sat solvers
- worst case
- exact algorithms
- tabu search
- satisfiability problem
- search algorithm
- sat problem
- vertex cover
- branch and bound
- primal dual
- randomized algorithms
- constraint satisfaction
- maximum satisfiability
- linear programming
- approximation ratio
- max sat solver
- upper bound
- boolean satisfiability
- np complete
- disjoint paths
- decision problems
- constant factor approximation
- constant factor