Abstract
We provide a rigorous analysis of a greedy approximation algorithm for the maximum random k-SAT (MAX-R-kSAT) problem. The algorithm assigns variables one at a time in a predefined order. A variable is assigned TRUE if it occurs more often positively than negatively; otherwise, it is assigned FALSE. After each variable assignment, problem instance is simplified and a new variable is selected. We show that this algorithm gives a 10/9.5-approximation, improving over the 9/8-approximation given by de la Vega and Karpinski [7]. The new approximation ratio is achieved by using a different algorithm than the one proposed in [7], along with a new upper bound on the maximum number of clauses that can be satisfied in a random k-SAT formula [2].
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
Achlioptas, D.: Lower Bounds for Random 3-SAT via Differential Equations. Theoretical Computer Science 265(1-2), 159–185 (2001)
Achlioptas, D., Naor, A., Peres, Y.: On the Fraction of Satisfiable Clauses in Typical Formulas. In: Extended Abstract in FOCS 2003, pp. 362–370 (2003)
Achlioptas, D., Sorkin, G.B.: Optimal Myopic Algorithms for Random 3-SAT. In: Proceedings of FOCS 2000, pp. 590–600 (2000)
Broder, A.Z., Frieze, A.M., Upfal, E.: On the satisfiability and maximum satisfiability of random 3-CNF formulas. In: Proc. 4th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 322–330 (1993)
Chao, M.-T., Franco, J.: Probability analysis of two heuristics for the 3-satisfiability problem. SIAM J. Comput. 15(4), 1106–1118 (1986)
Chao, M.T., Franco, J.: Probabilistic analysis of a generalization of the unit clause selection heuristic for the k-satisfiability problem. Information Sciences 51, 289–314 (1990)
de la Vega Fernandez, W., Karpinski, M.: 9/8-Approximation Algorithm for Random MAX-3SAT. In: Electronic Colloquium on Computational Complexity (ECCC), p. 70 (2002)
Kaporis, A.C., Kirousis, L.M., Lalas, E.G.: The probabilistic analysis of a greedy satisfiability algorithm. In: 10th Annual European Symposium on Algorithms, Rome, Italy (2002)
Kaporis, A.C., Kirousis, L.M., Lalas, E.: Selecting complementary pairs of literals. Electronic Notes in Discrete Mathematics 16 (2003)
Kaporis, A.C., Kirousis, L.M., Stamatiou, Y.C.: How to prove conditional randomness using the Principle of Deferred Decisions. Technical Report, Computer Technology Institute, Greece (2002), Available at: http://www.ceid.upatras.gr/faculty/kirousis/kks-pdd02.ps
Mitchell, D., Selman, B., Levesque, H.: Hard and easy distributions of sat problems. In: Proc. 10-th National Conf. on Artificial Intelligence (AAAI 1992), pp. 459–465 (1992)
Selman, B., Mitchell, D., Levesque, H.: Generating Hard Satisfiability Problems. Artificial Intelligence 81, 17–29 (1996)
Wormald, N.C.: Differential equations for random processes and random graphs. Ann. Appl. Probab. 5(4), 1217–1235, 36 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Interian, Y. (2005). Approximation Algorithm for Random MAX-kSAT. In: Hoos, H.H., Mitchell, D.G. (eds) Theory and Applications of Satisfiability Testing. SAT 2004. Lecture Notes in Computer Science, vol 3542. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11527695_14
Download citation
DOI: https://doi.org/10.1007/11527695_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27829-0
Online ISBN: 978-3-540-31580-3
eBook Packages: Computer ScienceComputer Science (R0)