Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs.
Eran HalperinUri ZwickPublished in: J. Algorithms (2001)
Keyphrases
- approximation algorithms
- semidefinite
- max sat
- np hard
- semidefinite programming
- primal dual
- branch and bound algorithm
- linear programming
- lower bound
- weighted max sat
- interior point methods
- special case
- search algorithm
- worst case
- tabu search
- sat solvers
- satisfiability problem
- branch and bound
- convex relaxation
- constraint satisfaction
- sat problem
- sufficient conditions
- higher dimensional
- convex optimization
- linear program
- convex sets
- simulated annealing
- optimal solution
- genetic algorithm
- decision problems
- np complete
- upper bound