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

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2004, Pages 136-145

  Khot, Subhash ^a,b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DENSEST SUBGRAPHS; GRAPH MIN-BISECTION; MINIMIM DISTANCE OF CODE PROBLEM (MDC); MINIMUM DISTANCE OF CODE;

APPROXIMATION THEORY; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; QUERY LANGUAGES;

GRAPH THEORY;

EID: 17744389433     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. M. Alekhnovich. More on average case vs approximation complexity. In Proc. 44th IEEE Symposium on Foundations of Computer Science, 2003.
2. N. Alon, U. Feige, A. Wigderson, D. Zuckerman. Derandomized graph products. Computational Complexity, 5, pages 60-75, 1995.
3. S. Arora, C. Lund, R. Motawani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501-555, 1998.
4. S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45(1):70-122, 1998.
5. S. Arora and M. Sudan. Improved low-degree testing and its applications. In Proc. 29th ACM Symposium on Theory of Computing, 1997.
6. M. Bellare, O. Goldreich and M. Sudan. Free bits, PCPs and non-Approximability - towards tight results. Siam Journal of Computing, Vol. 27, No. 3, pages 804-915, 1998.
7. E. Ben-Sasson, O. Goldreich, P. Harsha, M. Sudan and S. Vadhan. Robust PCPs of proximity, shorter PCPs and applications to coding. To appear in Proc. 36th ACM Symposium on Theory of Computing, 2004.
8. I. Dumer, D. Micciancio and M. Sudan. Hardness of Approximating the Minimum Distance of a Linear Code. In Proc. 40th IEEE Symposium on Foundations of Computer Science, 1999.
9. U. Feige. Relations between average case complexity and approximation complexity. In Proc. 34th ACM Symposium on Theory of Computing, 2002.
10. U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy. Interactive proofs and the hardness of approximating cliques. Journal of the ACM, 43(2):268-292, 1996.
11. U. Feige and S. Kogan. Hardness of approximation of the Balanced Complete Bipartite Subgraph problem. Technical Report MCS04-04, Department of Computer Science and Applied Math., The Weizmann Institute of Science.
12. U. Feige, G. Kortsarz, and D. Peleg. The dense k-subgraph problem. Algorithmica, 29(3):410-421, 2001.
13. U. Feige and R. Krauthgamer. A polylogarithmic approximation of the minimum bisection. In Proc. 41st IEEE Symposium on Foundations of Computer Science, pages 105-115, 2000.
14. P. Harsha and M. Sudan. Small PCPs with low query complexity. Computational Complexity, 9, Vol. 3-4, pages 157-201, 2000.
15. J. Håstad. Some optimal inapproximability results. In Proc. 29th ACM Symposium on Theory of Computing, pages 1-10, 1997.
16. J. Holmerin. Vertex cover on 4-uniform hypergraphs is hard to approximate within 2 - ε. In Proc. 34th ACM Symposium on Theory of Computing, 2002.
17. S. Khot and J. Holmerin. A new PCP outer verifier with applications to homogeneous linear equations and Max-Bisection. To appear in Proc. 36th ACM Symposium on Theory of Computing, 2004.
18. A. Lubotzky, R. Phillips, P. Sarnak. Ramanujan graphs. Combinatorica, Vol. 8, pages 261-277, 1988.
19. M. Luby, A. Wigderson. Pairwise independence and derandomization. Tech Report TR-95-035, International Computer Science Institute, 1995.