Abstract
Since MAX 2SAT is one of the famous NP-hard optimization problems, many heuristics and (polynomial-time) approximation algorithms have been proposed in the literature [1,4,5,6]. To evaluate the performance of such algorithms, there are two possibilities; theoretical analysis and empirical study.
In theoretical analysis, an approximation ratio of the algorithm is often used as a measure. The approximation ratio is an upper bound on the ratio of an approximated cost to the optimal cost, and hence, this is a worst case measure. It is often difficult to analyze theoretically the performance of heuristics or hybrid algorithms.
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
Asano, T., Williamson, D.P.: Improved approximation algorithms for MAX SAT. J. Algorithms 42, 173–202 (2002)
Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inform. Process. Lett. 8, 121–123 (1979)
Dimitriou, T.: A wealth of SAT distributions with planted assignments. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 274–287. Springer, Heidelberg (2003)
Feige, U., Goemans, M.X.: Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT. In: Proc. of ISTCS 1995, pp. 182–189 (1995)
Goemans, M.X., Williamson, D.P.: 879-approximation algorithms for MAX CUT and MAX 2SAT. In: Proc. of STOC 1994, pp. 422–431 (1994)
Hansen, P., Jaumard, B.: Algorithms for the maximum satisfiability problem. Computing 44, 279–303 (1990)
Håstad, J.: Some optimal inapproximability results. In: Proc. of STOC 1997, pp.1–10 (1997)
Khot, S., Kindler, G., Mossel, E., O’Donnell, R.: Optimal inapproximability results for Max-Cut and other 2-variable CSPs? In: Proc. of FOCS 2004, pp. 146–154 (2004)
Motoki, M.: Random instance generation for MAX 3SAT. In: Wang, J. (ed.) COCOON 2001. LNCS, vol. 2108, pp. 502–508. Springer, Heidelberg (2001)
Yamamoto, M.: On generating instances for MAX2SAT with optimal solutions. Dept. of Math. and Comp. Sciences Research Reports (Series C: Computer Science), C-191 (2004), http://www.is.titech.ac.jp/research/research-report/C/C-191.ps.gz
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
Motoki, M. (2005). Test Instance Generation for MAX 2SAT. In: van Beek, P. (eds) Principles and Practice of Constraint Programming - CP 2005. CP 2005. Lecture Notes in Computer Science, vol 3709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564751_65
Download citation
DOI: https://doi.org/10.1007/11564751_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29238-8
Online ISBN: 978-3-540-32050-0
eBook Packages: Computer ScienceComputer Science (R0)