Abstract
Given a boolean 2CNF formula F, the Max2Sat problem is that of finding the maximum number of clauses satisfiable simultaneously. In the corresponding decision version, we are given an additional parameter k and the question is whether we can simultaneously satisfy at least k clauses. This problem is NP-complete. We improve on known upper bounds on the worst case running time of Max2Sat, implying also new upper bounds for Maximum Cut. In particular, we give experimental results, indicating the practical relevance of our algorithms.
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
N. Bansal and V. Raman. Upper bounds for MaxSat: Further improved. In Proceedings of the 10th International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, Chennai, India, Dec. 1999. Springer-Verlag.
R. Battiti and M. Protasi. Approximate algorithms and heuristics for MAX-SAT. In D.-Z. Du and P. M. Pardalos, editors, Handbook of Combinatorial Optimization, volume 1, pages 77–148. Kluwer Academic Publishers, 1998.
B. Borchers and J. Furman. A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems. Journal of Combinatorial Optimization, 2(4):299–306, 1999.
J. Cheriyan, W. H. Cunningham, L. Tunçel, and Y. Wang. A linear programming and rounding approach to Max 2-Sat. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 26:395–414, 1996.
R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer-Verlag, 1999.
U. Feige and M. X. Goemans. Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT. In 3d IEEE Israel Symposium on the Theory of Computing and Systems, pages182–189, 1995.
M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco, 1979.
J. Gramm. Exact algorithms for Max2Sat: and their applications. Diplomarbeit, Universität Tübingen, 1999. Available through http://www-fs.informatik.unituebingen.de/~niedermr/publications/index.html.
J. Håstad. Some optimal inapproximability results. In Proceedings of the 29th ACM Symposium on Theory of Computing, pages 1–10, 1997.
E. A. Hirsch. A new algorithm for MAX-2-SAT. Technical Report TR99-036, ECCC Trier, 1999. To appear at STACS 2000.
M. Mahajan and V. Raman. Parameterizing above guaranteed values: MaxSat and MaxCut. Journal of Algorithms, 31:335–354, 1999.
R. Niedermeier and P. Rossmanith. New upper bounds for MaxSat. In Proceedings of the 26th International Conference on Automata, Languages, and Programming, number 1644 in Lecture Notes in Computer Science, pages 575–584. Springer-Verlag, July 1999. Long version to appear in Journal of Algorithms.
V. Raman, B. Ravikumar, and S. S. Rao. A simplified NP-complete MAXSAT problem. Information Processing Letters, 65:1–6, 1998.
B. Selman. MWFF: Program for generating random Maxk-Sat instances. Available from DIMACS, 1992.
M. Yannakakis. On the approximation of maximum satisfiability. Journal of Al-gorithms, 17:475–502, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gramm, J., Niedermeier, R. (2000). Faster Exact Solutions for Max2Sat . In: Bongiovanni, G., Petreschi, R., Gambosi, G. (eds) Algorithms and Complexity. CIAC 2000. Lecture Notes in Computer Science, vol 1767. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46521-9_15
Download citation
DOI: https://doi.org/10.1007/3-540-46521-9_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67159-6
Online ISBN: 978-3-540-46521-8
eBook Packages: Springer Book Archive