Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique

Assuming that NP /spl nsube//spl cap//sub /spl epsi/> 0/ BPTIME(2/sup n/spl epsi//), we show that graph min-bisection, densest subgraph and bipartite clique have no PTAS. We give a reduction from the minimum distance of code problem (MDC). Starting with an instance of MDC, we build a quasi-random PCP that suffices to prove the desired inapproximability results. In a quasi-random PCP, the query pattern of the verifier looks random in some precise sense. Among the several new techniques introduced, we give a way of certifying that a given polynomial belongs to a given subspace of polynomials. As is important for our purpose, the certificate itself happens to be another polynomial and it can be checked by reading a constant number of its values.

[1]  Noga Alon,et al.  Derandomized graph products , 1995, computational complexity.

[2]  Robert Krauthgamer,et al.  A Polylogarithmic Approximation of the Minimum Bisection , 2002, SIAM J. Comput..

[3]  Madhu Sudan,et al.  Small PCPs with low query complexity , 2000, computational complexity.

[4]  László Lovász,et al.  Interactive proofs and the hardness of approximating cliques , 1996, JACM.

[5]  Subhash Khot,et al.  A new PCP outer verifier with applications to homogeneous linear equations and max-bisection , 2004, STOC '04.

[6]  Mihir Bellare,et al.  Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[7]  Sanjeev Arora,et al.  Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.

[8]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

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

[10]  Uriel Feige,et al.  Relations between average case complexity and approximation complexity , 2002, STOC '02.

[11]  Avi Wigderson,et al.  Pairwise Independence and Derandomization , 2006, Found. Trends Theor. Comput. Sci..

[12]  Eli Ben-Sasson,et al.  Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding , 2004, SIAM J. Comput..

[13]  Madhu Sudan,et al.  Hardness of approximating the minimum distance of a linear code , 1999, IEEE Trans. Inf. Theory.

[14]  M. Murty.  Ramanujan Graphs , 1965 .

[15]  Shimon Kogan,et al.  Hardness of approximation of the Balanced Complete Bipartite Subgraph problem , 2004 .

[16]  Madhu Sudan,et al.  Improved Low-Degree Testing and its Applications , 1997, STOC '97.

[17]  Robert Krauthgamer,et al.  A polylogarithmic approximation of the minimum bisection , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.