Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs.
Eran HalperinUri ZwickPublished in: IPCO (1999)
Keyphrases
- approximation algorithms
- semidefinite
- max sat
- np hard
- semidefinite programming
- primal dual
- weighted max sat
- branch and bound algorithm
- lower bound
- interior point methods
- linear programming
- worst case
- special case
- satisfiability problem
- tabu search
- sat solvers
- search algorithm
- sat problem
- sufficient conditions
- branch and bound
- scheduling problem
- higher dimensional
- convex relaxation
- convex sets
- constraint satisfaction
- np complete
- upper bound
- machine learning
- randomly generated
- knapsack problem
- linear program
- genetic algorithm