Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs

DOI10.1006/jagm.2001.1162zbMath0999.90026OpenAlexW2035016254MaRDI QIDQ2746433

Uri Zwick, Eran Halperin

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

Mathematics Subject Classification ID

Semidefinite programming (90C22) Approximation algorithms (68W25)

Related Items (3)

An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT ⋮ An improved semidefinite programming relaxation for the satisfiability problem ⋮ Semidefinite Programming and Constraint Programming

This page was built for publication: Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs