MAX SAT approximation beyond the limits of polynomial-time approximation.
Evgeny DantsinMichael GavrilovichEdward A. HirschBoris KonevPublished in: Ann. Pure Appl. Log. (2001)
Keyphrases
- polynomial time approximation
- max sat
- np hard
- branch and bound algorithm
- approximation algorithms
- lower bound
- weighted max sat
- error bounds
- sat solvers
- tabu search
- search algorithm
- satisfiability problem
- sat problem
- np complete
- linear programming
- branch and bound
- approximation guarantees
- max sat solver
- unsatisfiable cores
- approximation ratio
- constraint satisfaction
- maximum satisfiability
- bin packing
- integer programming
- feasible solution
- cnf formula
- boolean formula
- boolean satisfiability
- worst case
- evolutionary algorithm