Abstract
MAX SAT (the maximum satisfiability problem) is stated as follows: given a set of clauses with weights, find a truth assignment that maximizes the sum of the weights of the satisfied clauses. In this paper, we present a theoretical framewok of hybrid approaches combining the algorithms of Goemans-Williamson and Yannakakis. This framework leads to a unified analysis of the performance guarantees of proposed algorithms and also leads to a better approximation algorithm with performance guarantee 0.770, if we use a refinement of Yannakakis' algorithm.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
T. Asano, Approximation algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson. Proc. 5th Israel Symposium on Theory of Computing and Systems, 1997, pp.24–37.
T. Asano, T. Ono and T. Hirata, Approximation algorithms for the maximum satisfiability problem. Nordic Journal of Computing, 3 (1996), pp.388–404.
T. Asano, K. Hori, T. Ono and T. Hirata, A refinement of Yannakakis's algorithm for MAX SAT. Information Processing Society of Japan, SIGAL-TR-54-11, 1996.
U. Feige and M. X. Goemans, Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT. Proc. 3rd Israel Symposium on Theory of Computing and Systems, 1995, pp.182–189.
M. X. Goemans and D. P. Williamson, New /34-approximation algorithms for the maximum satisfiability problem. SIAM J. Disc. Math., 7 (1994), pp.656–666.
M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42 (1995), pp.1115–1145.
M. Yannakakis, On the approximation of maximum satisfiability. Proc. 3rd SODA, 1992, pp.l–9 (and also J. Algorithms, 17 (1994), pp.475–502).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Asano, T., Hori, K., Ono, T., Hirata, T. (1997). A theoretical framework of hybrid approaches to MAX SAT. In: Leong, H.W., Imai, H., Jain, S. (eds) Algorithms and Computation. ISAAC 1997. Lecture Notes in Computer Science, vol 1350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63890-3_18
Download citation
DOI: https://doi.org/10.1007/3-540-63890-3_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63890-2
Online ISBN: 978-3-540-69662-9
eBook Packages: Springer Book Archive