Regular ArticleNew Upper Bounds for Maximum Satisfiability☆
References (52)
- et al.
On fixed-parameter tractability and approximability of NP optimization problems
J. Comput. System Sci.
(1997) New methods for 3-SAT decision and worst-case analysis
Theoret. Comput. Sci.
(1999)- et al.
Parameterizing above guaranteed values: MaxSat and MaxCut
J. Algorithms
(1999) - et al.
Solving satisfiability in less than 2n steps
Discrete Appl. Math.
(1985) - et al.
Optimization, approximation, and complexity classes
J. Comput. System Sci.
(1991) Algorithms for maximum independent sets
J. Algorithms
(1986)On the approximation of maximum satisfiability
J. Algorithms
(1994)Number of models and satisfiability of sets of clauses
Theoret. Comput. Sci.
(1996)- et al.
Proof verification and hardness of approximation problems
Proceedings of the 33d IEEE Symposium on Foundations of Computer Science
(1992) - et al.
A theoretical framework of hybrid approaches to MAX SAT
Proceedings of the 8th International Symposium on Algorithms and Computation
(1997)
Improved approximation algorithms for MAX SAT
Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms
(2000)
Upper bounds for MaxSat: Further improved
Proceedings of the 10th International Symposium on Algorithms and Computation
(1999)
Reactive Search, a history-base heuristic for MAX-SAT
ACM J. Exper. Algorithmics
(1997)
Approximate algorithms and heuristics for MAX-SAT
3-Coloring in time o(1.3446n): A no MIS algorithm
Proceedings of the 36th IEEE Symposium on Foundations of Computer Science
(1995)
A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
J. Combin. Optim.
(1999)
How to find the best approximation results—a follow-up to Garey and Johnson
ACM SIGACT News
(1998)
A computing procedure for quantification theory
J. Assoc. Comput. Mach.
(1960)
Parameterized Complexity
(1999)
Parameterized complexity: A framework for systematically confronting computational intractability
Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future
(1999)
Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT
3d IEEE Israel Symposium on the Theory of Computing and Systems
(1995)
Computers and Intractability: A Guide to the Theory of NP-completeness
(1979)
Cited by (0)
- ☆
An extended abstract of this paper was presented at the 26th International Colloquium on Automata, Languages, and Programming (ICALP'99), Prague, Czech Republic, July 11–15, 1999, Lecture Notes in Computer Science, Vol. 1644, pp. 575–584, Springer-Verlag, Berlin/New York.
- 2
Supported by a Feodor Lynen fellowship (1998) of the Alexander von Humboldt-Stiftung, Bonn, and the Center for Discrete Mathematics, Theoretical Computer Science and Applications (DIMATIA), Prague.
Copyright © 2000 Academic Press. All rights reserved.