Goemans, Michel X.; Williamson, David P. New \(3\over4\)-approximation algorithms for the maximum satisfiability problem. (English) Zbl 0812.90129 SIAM J. Discrete Math. 7, No. 4, 656-666 (1994). Cited in 2 ReviewsCited in 37 Documents MSC: 90C27 Combinatorial optimization 68Q25 Analysis of algorithms and problem complexity 90C05 Linear programming 90C60 Abstract computational complexity for mathematical programming problems Keywords:approximation algorithm; probabilistic method; performance guarantee; linear programming relaxations; maximum satisfiability problem; randomized rounding; worst-case analysis PDF BibTeX XML Cite \textit{M. X. Goemans} and \textit{D. P. Williamson}, SIAM J. Discrete Math. 7, No. 4, 656--666 (1994; Zbl 0812.90129) Full Text: DOI