On Approximation Algorithms for Hierarchical MAX-SAT.
Sameet AgarwalAnne CondonPublished in: Computational Complexity Conference (1995)
Keyphrases
- approximation algorithms
- max sat
- exact algorithms
- np hard
- lower bound
- weighted max sat
- branch and bound algorithm
- worst case
- special case
- vertex cover
- sat solvers
- search algorithm
- tabu search
- branch and bound
- satisfiability problem
- randomized algorithms
- upper bound
- sat problem
- linear programming
- constant factor
- approximation ratio
- constraint satisfaction
- max sat solver
- optimal solution
- cnf formula
- polynomial time approximation
- maximum satisfiability
- constant factor approximation
- learning algorithm
- primal dual
- integer programming