Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT

  title={Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT},
  author={Uriel Feige and Michel X. Goemans},
  journal={Proceedings Third Israel Symposium on the Theory of Computing and Systems},
  • U. Feige, M. Goemans
  • Published 4 January 1995
  • Computer Science, Mathematics
  • Proceedings Third Israel Symposium on the Theory of Computing and Systems
It is well known that two prover proof systems are a convenient tool for establishing hardness of approximation results. In this paper, we show that two prover proof systems are also convenient starting points for establishing easiness of approximation results. Our approach combines the Feige-Lovasz (STOC92) semidefinite programming relaxation of one-round two-prover proof systems, together with rounding techniques for the solutions of semidefinite programs, as introduced by Goemans and… 

Tables from this paper

Sums of squares based approximation algorithms for MAX-SAT
Free bits, PCPs and non-approximability-towards tight results
A proof system for NP is presented using logarithmic randomness and two amortized free bits, so that Max clique is hard within N/sup 1/3/ and chromatic number within N-Sup 1/5/, and a comprehensive study of PCP and FPCP parameters is initiated.
Fundamentals of Computation Theory
An improved analysis of Goemans and Williamson’s LP-relaxation for MAX SAT is presented which is simpler than the previous analysis and will play a role as a better building block in designing an improved approximation algorithm forMAX SAT.
Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems
Improved approximation algorithms for the MAX 2-SAT and MAX DI-CUT problems are obtained, which are essentially the best performance ratios that can be achieved using any combination of prerounding rotations and skewed distributions of hyperplanes, and even using more general families of rounding procedures.
An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT
Improved approximation algorithms for MAX SAT
This paper considers approximation algorithms for MAX SAT proposed by Goemans and Williamson and presents a sharpened analysis of their performance guarantees, and shows that these algorithms, combined with recent approximation algorithm for MAX 2SAT, MAX 3S AT, and MAX SAT due to Feige and Goeman, Karloff and Zwick, andZwick, respectively, lead to an improved approximation algorithm.
Approximating generalizations of Max Cut
This thesis studies the approximability of different generalizations of the Max Cut problem, and shows that Max Set Splitting and Max Not-All-Equal Sat are both approximable within 1.380 in probabilistic polynomial time.
Beyond Baker's Technique
This paper proposes a unified framewo rk to formulate the optimization problems where the local constraints of these problems are encoded by functions attached on the vertices, and generalizes Baker’s technique and many existing methods of graph decomposition.
Improved Approximation Algorithms for Maximum Cut and Satissability Problems Using Semideenite Programming
This algorithm gives the rst substantial progress in approximating MAX CUT in nearly twenty years, and represents the first use of semideenite programming in the design of approximation algorithms.
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
A "reversal" of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems is presented and any NP-hardness of approximation result for MaxClique yields a proof system for NP.


Interactive proofs and approximation: reductions from two provers in one round
  • M. Bellare
  • Mathematics
    [1993] The 2nd Israel Symposium on Theory and Computing Systems
  • 1993
The author presents hard to approximate problems in the following areas: systems of representatives, network flow, and longest paths in graphs. In each case he shows that there exists some delta >0
A New 3 4 -approximation Algorithm for Max Sat
A new 3 4-approximation algorithm that depends solely on the solution to a linear programming relaxation of MAX SAT, which uses the probabilistic method/randomized rounding in an unusual way and achieves a tight worst-case analysis of the corresponding duality gap.
Proof verification and hardness of approximation problems
The authors improve on their result by showing that NP=PCP(logn, 1), which has the following consequences: (1) MAXSNP-hard problems do not have polynomial time approximation schemes unless P=NP; and (2) for some epsilon >0 the size of the maximal clique in a graph cannot be approximated within a factor of n/sup ePSilon / unless P =NP.
The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations
The Nearest Lattice Vector Problem (in any l/sub p/ norm), the Nearest Code-word Problem for binary codes, the problem of learning a halfspace in the presence of errors, and some other problems are proved.
The ellipsoid method and its consequences in combinatorial optimization
The method yields polynomial algorithms for vertex packing in perfect graphs, for the matching and matroid intersection problems, for optimum covering of directed cuts of a digraph, and for the minimum value of a submodular set function.
On the cut polytope
It is shown that inequalities associated with chordless cycles define facets of this polytope; moreover, for these inequalities a polynomial algorithm to solve the separation problem is presented.
On the hardness of approximating minimization problems
It is proved that there is an e > 0 such that Graph Coloring cannot be approximated with ratio n e unless P = NP, and Set Covering cannot be approximation with ratio c log n for any c < 1/4 unless NP is contained in DTIME(n poly log n).
Optimization, Approximation, and Complexity Classes
A natural variant of NP, MAX NP, and also a subclass called MAX SNP are defined, which contain several natural, well-studied classes of optimization problems, and it is shown that problems in these classes can be approximated with some bounded error.
On the approximation of maximum satisfiability
We present a 3/4 polynomial time approximation algorithm for the Maximum Satisfiability problem: Given a set of clauses, find a truth assignment that satisfies the maximum number of clauses. The
On the Shannon capacity of a graph
  • L. Lovász
  • Mathematics, Computer Science
    IEEE Trans. Inf. Theory
  • 1979
It is proved that the Shannon zero-error capacity of the pentagon is \sqrt{5} and a well-characterized, and in a sense easily computable, function is introduced which bounds the capacity from above and equals the capacity in a large number of cases.