A strong inapproximability gap for a generalization of minimum bisection

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2003, Pages 371-378

  Holmerin, Jonas ^a   Khot, Subhash ^b  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; LINEAR EQUATIONS; PROBLEM SOLVING; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; NUMERICAL ANALYSIS;

BALANCED ASSIGNMENT;

COMPUTATIONAL COMPLEXITY; APPROXIMATION ALGORITHMS;

BISECTION PROBLEMS; EQUATIONS; HOMOGENEOUS SYSTEM; INAPPROXIMABILITY; NP COMPLETE; NP-HARD; OBJECT FUNCTIONS;

EID: 0043016124     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501-555, May 1998.
2. S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45(1):70-122, Jan. 1998.
3. M. Bellare, O. Goldreich, and M. Sudan. Free bits, PCPs and non-approximability - towards tight results. SIAM Journal on Computing, 27(3):804-915, June 1998.
4. U. Feige. A threshold of In n for approximating set cover. Journal of the ACM, 45(4):634-652, July 1998.
5. U. Feige. Relations between average case complexity and approximation complexity. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 534-543, Montréal, Québec, Canada, 19-21 May 2002.
6. U. Feige, 2003. Personal Communication.
7. 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, Mar. 1996.
8. U. Feige and R. Krauthgamer. A polylogarithmic approximation of the minimum bisection. In 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, California, 12-14 Nov. 2000. IEEE.
9. 1-ε. Acta Mathematica, 182(1):105-142, 1999.
10. J. Håstad. Some optimal inapproximability results. Journal of the ACM, 48(4):798-859, July 2001.
11. M. Karpinski. On approximability of minimum bisection problem. Technical Report TR02-046, Electronic Colloquium on Computational Complexity, July 2002.
12. T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In 29th Annual Symposium on Foundations of Computer Science, pages 422-431, White Plains, New York, 24-26 Oct. 1988. IEEE.
13. R. Raz. A parallel repetition theorem. SIAM Journal on Computing, 27(3):763-803, June 1998.