An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT (Q2368971): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2005.11.030
@@ Property / DOI: 10.1016/j.tcs.2005.11.030 / rank @@
-Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for MAX SAT
@@ Property / cites work: Improved Approximation Algorithms for MAX SAT / rank @@
+Normal rank
@@ Property / cites work @@
+New  $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+Outward rotations
@@ Property / cites work: Outward rotations / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2005.11.030
@@ Property / DOI: 10.1016/J.TCS.2005.11.030 / rank @@
+Normal rank