Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT.
Jens GrammEdward A. HirschRolf NiedermeierPeter RossmanithPublished in: Discret. Appl. Math. (2003)
Keyphrases
- max sat
- max cut
- upper bound
- lower bound
- worst case
- graph coloring
- np complete problems
- np hard
- branch and bound algorithm
- branch and bound
- weighted max sat
- upper and lower bounds
- approximation algorithms
- graph model
- objective function
- lower and upper bounds
- planar graphs
- optimal solution
- np complete
- linear programming
- greedy algorithm
- sample complexity
- decision problems
- spectral graph
- scheduling problem
- randomly generated
- constraint satisfaction
- constraint satisfaction problems
- graph partitioning
- satisfiability problem
- sat problem
- orders of magnitude
- knapsack problem
- sat solvers
- integer programming
- phase transition
- information retrieval systems
- belief revision
- learning algorithm