On Approximation Algorithms for Hierarchical MAX-SAT
نویسندگان
چکیده
We prove upper and lower bounds on performance guarantees of approximation algorithms for the Hierarchical MAX-SAT (H-MAX-SAT) problem. This problem is representative of a broad class of PSPACE-hard problems involving graphs, Boolean formulas and other structures that are de ned succinctly. Our rst result is that for some constant < 1, it is PSPACE-hard to approximate the function H-MAX-SAT to within ratio . We obtain our result using a reduction from the language recognition problem for a model of PSPACE called the probabilistically checkable debate system. As an immediate application, we obtain nonapproximability results for functions on hierarchical graphs by combining our result with previously known approximation-preserving reductions to other problems. For example, it is PSPACE-hard to approximate H-MAX-CUT and H-MAX-INDEPENDENT-SET to within some constant factor. Our second result is that there is an e cient approximation algorithm for H-MAX-SAT with performance guarantee 2/3. The previous best bound claimed for this problem was 1/2. One new technique of our algorithm can be used to obtain approximation algorithms for other problems, such as hierarchical MAX-CUT, which are simpler than previously known algorithms and which have performance guarantees that match the previous best bounds. 2
منابع مشابه
Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT
MAX SAT and MAX NAE-SAT are central problems in theoretical computer science. We present an approximation algorithm for MAX NAE-SAT with a conjectured performance guarantee of 0.8279. This improves a previously conjectured performance guarantee of 0.7977 of Zwick [Zwi99]. Using a variant of our MAX NAE-SAT approximation algorithm, combined with other techniques used in [Asa03], we obtain an app...
متن کاملApproximation algorithms for MAX 4 - SATand rounding procedures for semide nite programs
Karloo and Zwick obtained recently an optimal 7=8-approximation algorithm for MAX 3-SAT. In an attempt to see whether similar methods can be used to obtain a 7=8-approximation algorithm for MAX SAT, we consider the most natural generalization of MAX 3-SAT, namely MAX 4-SAT. We present a semideenite programming relaxation of MAX 4-SAT and a new family of rounding procedures that try to cope well...
متن کاملApproximation Algorithms for MAX SAT
Maximum Satisfiability Problem (MAX SAT) is one of the most natural optimization problems. It is known to be NP-hard. Hence, approximation algorithms have been considered. The aim of this survey is to show recent developments of approximation algorithms for MAX SAT. We will confine ourselves to approximation algorithms with theoretical performance guarantees. For other approximation algorithms ...
متن کاملApproximating MAX SAT by Moderately Exponential and Parameterized Algorithms
We study approximation of the max sat problem by moderately exponential algorithms. The general goal of the issue of moderately exponential approximation is to catch-up on polynomial inapproximability, by providing algorithms achieving, with worst-case running times importantly smaller than those needed for exact computation, approximation ratios unachievable in polynomial time. We develop seve...
متن کاملApproximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
Karloo and Zwick obtained recently an optimal 7=8-approximation algorithm for MAX 3-SAT. In an attempt to see whether similar methods can be used to obtain a 7=8-approximation algorithm for MAX SAT, we consider the most natural generalization of MAX 3-SAT, namely MAX 4-SAT. We present a semideenite programming relaxation of MAX 4-SAT and a new family of rounding procedures that try to cope well...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Algorithms
دوره 26 شماره
صفحات -
تاریخ انتشار 1995