Abstract
For MAX SAT, which is a well-known NP-hard problem, many approximation algorithms have been proposed. Two types of best approximation algorithms for MAX SAT were proposed by Asano and Williamson: one with best proven performance guarantee 0.7846 and the other with performance guarantee 0.8331 if a conjectured performance guarantee of 0.7977 is true in the Zwick’s algorithm. Both algorithms are based on their sharpened analysis of Goemans and Williamson’s LP-relaxation for MAX SAT. In this paper, we present an improved analysis which is simpler than the previous analysis. Furthermore, algorithms based on this analysis will play a role as a better building block in designing an improved approximation algorithm for MAX SAT. Actually we show an example that algorithms based on this analysis lead to approximation algorithms with performance guarantee 0.7877 and conjectured performance guarantee 0.8353 which are slightly better than the best known corresponding performance guarantees 0.7846 and 0.8331 respectively.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Asano, T., Williamson, D.P.: Improved approximation algorithms for MAX SAT. Journal of Algorithms 42, 173–202 (2002)
Feige, U., Goemans, M.X.: Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT. In: Proc. 3rd Israel Symposium on Theory of Computing and Systems, pp. 182–189 (1995)
Goemans, M.X., Williamson, D.P.: New 3/4-approximation algorithms for the maximum satisfiability problem. SIAM Journal on Discrete Mathematics 7, 656–666 (1994)
Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM 42, 1115–1145 (1995)
Håstad, J.: Some optimal inapproximability results. In: Proc. 28th ACM Symposium on the Theory of Computing, pp. 1–10 (1997)
Halperin, E., Zwick, U.: Approximation algorithms for MAX 4-SAT and rounding procedures for semidefinite programs. Journal of Algorithms 40, 184–211 (2001)
Zwick, U.: Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems. In: Proc. 31st ACM Symposium on the Theory of Computing, pp. 679–687 (1999)
Karloff, H., Zwick, U.: A 7/8-approximation algorithm for MAX 3SAT? In: Proc. 38th IEEE Symposium on the Foundations of Computer Science, pp. 406–415 (1997)
Zwick, U.: Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems. In: Proc. 31st ACM Symposium on the Theory of Computing, pp. 679–687 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Asano, T. (2003). An Improved Analysis of Goemans and Williamson’s LP-Relaxation for MAX SAT. In: Lingas, A., Nilsson, B.J. (eds) Fundamentals of Computation Theory. FCT 2003. Lecture Notes in Computer Science, vol 2751. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45077-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-45077-1_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40543-6
Online ISBN: 978-3-540-45077-1
eBook Packages: Springer Book Archive