An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT (Q2368971): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Improved Approximation Algorithms for MAX SAT / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Approximation algorithms for combinatorial problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Outward rotations / rank | |||
Normal rank |
Revision as of 12:11, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT |
scientific article |
Statements
An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT (English)
0 references
28 April 2006
0 references
Approximation algorithm
0 references
MAX SAT
0 references
LP-relaxation
0 references
0 references
0 references