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

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 Williamson (STOC94). As a consequence of our approach, we present improved approximation algorithms for MAX 2SAT and MAX DICUT. The algorithms are guaranteed to deliver solutions within a factor of 0.931 of the optimum for MAX 2SAT and within a factor of 0.859 for MAX DICUT, improving upon the guarantees of 0.878 and 0.796 of Goemans and Williamson (1994).<<ETX>>

[1]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[2]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[3]  Ali Ridha Mahjoub,et al.  On the cut polytope , 1986, Math. Program..

[4]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[5]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[6]  Mihalis Yannakakis,et al.  On the approximation of maximum satisfiability , 1992, SODA '92.

[7]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[8]  László Lovász,et al.  Two-prover one-round proof systems: their power and their problems (extended abstract) , 1992, STOC '92.

[9]  Mihir Bellare,et al.  Interactive proofs and approximation: reductions from two provers in one round , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[10]  Francisco Barahona,et al.  On cuts and matchings in planar graphs , 1993, Math. Program..

[11]  Carsten Lund,et al.  On the hardness of approximating minimization problems , 1994, JACM.

[12]  David P. Williamsony.  A New 3 4 -approximation Algorithm for Max Sat , 1994 .

[13]  Alexander I. Barvinok,et al.  Problems of distance geometry and convex properties of quadratic maps , 1995, Discret. Comput. Geom..

[14]  Alan M. Frieze,et al.  Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION , 1995, IPCO.

[15]  Jacques Stern,et al.  The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations , 1997, J. Comput. Syst. Sci..