Tight approximability of MAX 2-SAT and relatives, under UGC.
Joshua BrakensiekNeng HuangUri ZwickPublished in: SODA (2024)
Keyphrases
- simulated annealing
- max sat
- tabu search
- lower bound
- weighted max sat
- upper bound
- branch and bound algorithm
- branch and bound
- genetic algorithm
- user generated content
- evolutionary algorithm
- stochastic local search
- approximation algorithms
- worst case
- maximum satisfiability
- search algorithm
- np hard
- unsatisfiable cores
- variable ordering
- sat solvers
- satisfiability problem
- sat problem
- objective function
- boolean satisfiability
- information retrieval
- linear programming
- phase transition
- optimal solution
- constraint satisfaction
- unit propagation
- np complete