.879-approximation algorithms for MAX CUT and MAX 2SAT.
Michel X. GoemansDavid P. WilliamsonPublished in: STOC (1994)
Keyphrases
- approximation algorithms
- max cut
- max sat
- np hard
- branch and bound algorithm
- lower bound
- np complete problems
- graph coloring
- linear programming
- np complete
- sat problem
- special case
- optimal solution
- integer programming
- scheduling problem
- worst case
- randomly generated
- minimum cost
- search algorithm
- constraint satisfaction problems
- constraint satisfaction
- satisfiability problem
- branch and bound
- upper bound
- sat solvers
- tabu search
- computational complexity
- graph model
- objective function
- knapsack problem
- linear program
- undirected graph
- decision problems
- graph partitioning
- primal dual
- greedy heuristic
- reinforcement learning
- dynamic programming