Tight approximability of MAX 2-SAT and relatives, under UGC.
Joshua BrakensiekNeng HuangUri ZwickPublished in: CoRR (2023)
Keyphrases
- max sat
- lower bound
- upper bound
- branch and bound algorithm
- weighted max sat
- branch and bound
- user generated content
- worst case
- approximation algorithms
- stochastic local search
- np hard
- sat solvers
- satisfiability problem
- search algorithm
- tabu search
- constraint satisfaction
- objective function
- sat problem
- variable ordering
- maximum satisfiability
- unsatisfiable cores
- search space
- boolean satisfiability
- linear programming
- random sat instances
- max sat solver
- metaheuristic
- social media