Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
From MaRDI portal
Publication:2746433
DOI10.1006/jagm.2001.1162zbMath0999.90026MaRDI QIDQ2746433
Publication date: 1 December 2002
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.2001.1162
Related Items
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