Approximation algorithms for MAX-4-SAT and rounding procedures for semidefinite programs
From MaRDI portal
Recommendations
- Approximation algorithms for MAX 4-SAT and rounding procedures for semidefinite programs
- .878-approximation algorithms for MAX CUT and MAX 2SAT
- New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
- scientific article; zbMATH DE number 1263278
- Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems
Cited in
(9)- An improved semidefinite programming relaxation for the satisfiability problem
- An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT
- Semidefinite programming and constraint programming
- Approximation algorithms for MAX 4-SAT and rounding procedures for semidefinite programs
- Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems
- scientific article; zbMATH DE number 2119703 (Why is no real title available?)
- scientific article; zbMATH DE number 956857 (Why is no real title available?)
- On the mysteries of MAX NAE-SAT
- Separating \textsc{max} 2-and, \textsc{max di-cut}, and \textsc{max cut}
This page was built for publication: Approximation algorithms for MAX-4-SAT and rounding procedures for semidefinite programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2746433)