Improved approximation algorithms for MAX SAT

@article{Asano2000ImprovedAA,
  title={Improved approximation algorithms for MAX SAT},
  author={Takao Asano and David P. Williamson},
  journal={J. Algorithms},
  year={2000},
  volume={42},
  pages={173-202}
}
MAX SAT (the maximum satisfiability problem) is stated as follows: given a set of clauses with weights, find a truth assignment that maximizes the sum of the weights of the satisfied clauses. In this paper, we consider approximation algorithms for MAX SAT proposed by Goemans and Williamson and present a sharpened analysis of their performance guarantees. We also show that these algorithms, combined with recent approximation algorithms for MAX 2SAT, MAX 3SAT, and MAX SAT due to Feige and Goemans… CONTINUE READING
Highly Influential
This paper has highly influenced 24 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Similar Papers

Loading similar papers…