Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming.
Michel X. GoemansDavid P. WilliamsonPublished in: J. ACM (1995)
Keyphrases
- approximation algorithms
- semidefinite programming
- satisfiability problem
- primal dual
- np hard
- np complete
- integrality gap
- linear programming
- special case
- linear program
- worst case
- search algorithm
- temporal logic
- phase transition
- sat problem
- semidefinite
- maximum margin
- convergence rate
- lower bound
- max sat
- valid inequalities
- feasible solution