Sums of squares based approximation algorithms for MAX-SAT.
Hans van MaarenLinda van NordenM. J. H. HeulePublished in: Discret. Appl. Math. (2008)
Keyphrases
- approximation algorithms
- max sat
- np hard
- branch and bound algorithm
- lower bound
- weighted max sat
- worst case
- sat solvers
- search algorithm
- special case
- branch and bound
- tabu search
- satisfiability problem
- exact algorithms
- linear programming
- vertex cover
- sat problem
- constraint satisfaction
- approximation ratio
- np complete
- primal dual
- upper bound
- boolean satisfiability
- maximum satisfiability
- disjoint paths
- randomized algorithms
- random variables
- constant factor
- cnf formula
- max sat solver
- polynomial time approximation
- randomly generated
- decision problems
- scheduling problem
- feasible solution