Abstract
In this work we consider the MAX SAT problem with the additional constraint that at most p variables have a true value. We obtain (1 — e −1)-approximation algorithm for this problem. Feige [5] proves that for the MAX SAT with cardinality constraint with clauses without negations this is the best possible performance guarantee unless P=NP.
Supported by the grant 97-01-00890 of the Russian Foundation for Basic Research.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Spencer, J.H.: Probabilistic Method. Wiley, 1992.
Asano, T.: Approximation algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson. In Proceedings of the 5nd Israel Symposium on Theory and Computing Systems (1997) 182–189
Goemans, M., Williamson, D.: New 3/4-approximation algorithms for the maximum satisfiability problem. SIAM Journal on Discrete Mathematics 7 (1994) 656–666
Goemans M., Williamson, D.: Imroved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming Journal of ACM 42 (1995) 1115–1145
Feige, U.: A threshold of Inn for approximating set cover. Journal of ACM (to appear)
Feige, U., Goemans, M.: Approximating the value of two-prover proof systems, with applications to MAX 2-SAT and MAX-DICUT. In Proceedings of the 3nd Israel Symposium on Theory and Computing Systems (1995) 182–189
Feller, W.: An Introduction to Probability Theory and Its Applications. John Wiley & Sons New York (1968)
Hastad, J.: Some optimal inapproximability results. In Proceedings of the 28 Annual ACM Symp. on Theory of Computing (1996) 1–10
Karloff, H., Zwick, U.: A 7/8-approximation algorithm for MAX 3SAT? In Proceedings of the 38th FOCS (1997) 406–415
Khanna, S., Motwani, R.: Towards syntactic characterization of PTAS. In Proceedings of the 28 Annual ACM Symp. on Theory of Computing (1996) 329–337
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sviridenko, M.I. (1998). Best possible approximation algorithm for MAX SAT with cardinality constraint. In: Jansen, K., Rolim, J. (eds) Approximation Algorithms for Combinatiorial Optimization. APPROX 1998. Lecture Notes in Computer Science, vol 1444. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053975
Download citation
DOI: https://doi.org/10.1007/BFb0053975
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64736-2
Online ISBN: 978-3-540-69067-2
eBook Packages: Springer Book Archive