Abstract
We present a randomized polynomial-time approximation algorithm for the MAX-2-SAT problem in the presence of an extra cardinality constraint which has an asymptotic worst-case ratio of 0.75. This improves upon the previously best approximation ratio 0.6603 which was achieved by Bläser and Manthey [BM]. Our approach is to use a solution obtained from a linear program which we first modify greedily and to which we then apply randomized rounding. The greedy phase guarantees that the errors introduced by the randomized rounding are not too large, an approach that might be interesting for other applications as well.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arora, S., Karger, D.R., Karpinski, M.: Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems. J. Computer and System Sciences 58(1), 193–210 (1999)
Ageev, A.A., Sviridenko, M.: Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts. In: Cornuéjols, G., Burkard, R.E., Woeginger, G.J. (eds.) IPCO 1999. LNCS, vol. 1610, pp. 17–30. Springer, Heidelberg (1999)
Asano, T., Williamson, D.P.: Improved Approximation Algorithms for MAX SAT. J. Algorithms 42(1), 173–202 (2002)
Bläser, M., Manthey, B.: Improved Approximation Algorithms for MAX- 2SAT with Cardinality Constraints. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 187–198. Springer, Heidelberg (2002)
Feige, U.: A Threshold of ln n for Approximating Set Cover. J. of the ACM 45(4), 634–652 (1998)
Feige, U., Langberg, M.: Approximation Algorithms for Maximization Problems Arising in Graph Partitioning. J. Algorithms 41(2), 174–211 (2001)
Goemans, M.X., Williamson, D.P.: New 3/4–Approximation Algorithms for the Maximum Satisfiability Problem. SIAM J. Discrete Mathematics 7(4), 656–666 (1994)
Goemans, M.X., Williamson, D.P.: Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming. J. of the ACM 42(6), 1115–1145 (1995)
Håstad, J.: Some Optimal Inapproximability Results. J. of the ACM 48(4), 798–859 (2001)
Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
Sviridenko, M.: Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint. Algorithmica 30(3), 398–405 (2001)
Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)
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
Hofmeister, T. (2003). An Approximation Algorithm for MAX-2-SAT with Cardinality Constraint. In: Di Battista, G., Zwick, U. (eds) Algorithms - ESA 2003. ESA 2003. Lecture Notes in Computer Science, vol 2832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39658-1_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-39658-1_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20064-2
Online ISBN: 978-3-540-39658-1
eBook Packages: Springer Book Archive