Abstract
Maximum Satisfiability problem is the central problem in theoretical computer science. Local search has been testified to be effective in the practice to solve these problems. This paper presents new local search methods to solve the maximum satisfiability problems and analyzes the performance of the methods. We focus on the sub problem with each clause containing at least k literals, Max-(k)-Sat briefly. The central issue is to discuss the local search algorithms as well as their performance to solve Max-(2)-Sat and Max-(3)-Sat. We first propose a local search algorithm to solve Max-(2)-Sat. This algorithm can achieve the performance ratio not larger than 4/3 and can be extended to solve Max-(k)-Sat with performance ratio not larger than \(\frac{k+2}{k+1}\) for k ≥ 3. We then propose a local search algorithm for Max-(3)-Sat and show that the algorithm can achieve the performance ratio not larger than 8/7. This algorithm can be extended to solve Max-(k)-Sat with performance ratio not larger than \(\frac{2k+2}{2k+1}\) for k ≥ 4. We can give examples to show that the aforementioned bounds are all tight. The algorithm for Max-(3)-Sat can naturally derive the local search algorithms for Not-2Sat and Not-3Sat with performance ratio 2 and \(\frac{4}{3}\) 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.
Similar content being viewed by others
References
Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the 3rd Annual ACM Symposium on Theorey of Computing, Shaker Heights, Ohio,USA, pp. 151–158. ACM, New York (1971)
Papadimitriou, C.H., Yanakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43(3), 425–440 (1991)
Johnson, D.S.: Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences 9(3), 256–278 (1974)
Chen, J., Friesen, D., Zheng, H.: Tight bound on Johnson’s algorithm for maximum satisfiability. Journal of Computer and System Sciences 58(3), 622–640 (1999)
Yannakakis, M.: On the approximation of maximum satisfiability. Journal of Algorithms 17, 475–502 (1994)
Goemans, M.X., Williamson, D.P.: New 3/4-approximation algorithms for the maximum satisfiability problem. Siam Journal on Discrete Mathematics 7(4), 656–666 (1994)
Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semi-definite programming. Journal of the ACM 42(6), 1115–1145 (1995)
Feige, U., Goemans, M.X.: Approximating the value of two power proof systems, with applications to Max-2Sat and Max-Dicut. In: Proceedings of the 3rd Israel Symposium on Theorey and Computing Systems, Tel Aviv, Israel, pp. 182–189. IEEE, Washington, DC, USA (1995)
Trevisan, L., Sorkin, G.B., Sudan, M., Williamson, D.P.: Gadets, approximation, and linear programming. In: Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, Burlington, Vermont, pp. 617–626. IEEE, Washington, DC, USA (1996)
Trevisan, L.: Approximating satisfiable satisfiability problems. Algorithmica 28(1), 145–172 (2000)
Karloff, H., Zwick, U.: A 7/8-approximation algorithm for Max 3Sat? In: Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, Miami Beach, Florida, pp. 406–415. IEEE, Washington, DC, USA (1997)
Halperin, E., Zwick, U.: Approximation algorithms for MAX 4-SAT and rounding procedures for semidefinite programs. Journal of Algorithms 40(2), 184–211 (2001)
Hastad, J.: Some optimal inapproximability results. In: Proceedings of the 28th Annual ACM Symposium on Theorey of Computing, El Paso, Texas, pp. 1–10. ACM, New York (1997)
Gu, J.: Efficient local search for very large-scale satisfiability problems. ACM SIGART Bulletin 3(1), 8–12 (1992)
Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisfiability problems. In: Proceedings of the 10th National Conference on Artificial Intelligence, Pasadena, Calefornia, pp. 440–446 (1992)
Koutsoupias, E., Papadimitriou, C.H.: On the greedy algorithm for satisfiability. Information Processing Letters 43(1), 53–55 (1992)
Hansen, P., Jaumard, B.: Algorithms for the maximum satisfiability problem. Computing 44(4), 279–303 (1990)
Mastrolilli, M., Gambardella, L.M.: Max-2-Sat: How good is tabu search in the worst case? In: Proceedings of AAAI, pp. 173–178 (2004)
Pankratov, D., Borodin, A.: On the relative merits of simple local search methods for the MAX-SAT problem. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 223–236. Springer, Heidelberg (2010)
Hirsch, E.A.: Worst Case Study of Local Search for Max-k-Sat. Discrete Applied Mathematics 130(2), 173–184 (2003)
Bulatov, A.A., Skvortsov, E.S.: The Efficiency of local search. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 297–310. Springer, Heidelberg (2006)
Papadimitriou, C.H.: Computational Complexity, pp. 185–188. Addison Wesley, Reading (1994)
Agarwal, A., Charikar, M., Makarychev, K., Makarychev, Y.: \(\sqrt{logn}\) algorithm for Min UnCut, Min 2CNF deletion, and directed cut problems. In: Proceeding of STOC 2005, pp. 573–581 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhu, D., Ma, S., Zhang, P. (2011). Tight Bounds on Local Search to Approximate the Maximum Satisfiability Problems. In: Fu, B., Du, DZ. (eds) Computing and Combinatorics. COCOON 2011. Lecture Notes in Computer Science, vol 6842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22685-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-22685-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22684-7
Online ISBN: 978-3-642-22685-4
eBook Packages: Computer ScienceComputer Science (R0)