Approximation algorithms for MAX SAT
Tomio Hirata, Takao Ono · Institutional Repositories DataBase (IRDB) · 2000
Maximum Satisfiability Problem (MAX SAT) is one of the most natural optimization problems. Since it is known to be NP-hard, approximation algorithms have been considered. The aim of this survey is to show recent developments of approximation algorithms for MAX SAT.