Approximating the cut-norm via Grothendieck's inequality

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 72-80

  Alon, Noga ^a   Naor, Assaf ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Cut Norm; Grothendieck's Inequaity; Rounding Techniques

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; QUADRATIC PROGRAMMING; VECTORS;

CUT-NORMS; GROTHENDIECK'S INEQUALITY; QUADRATIC INTEGER PROGRAMMING; ROUNDING TECHNIQUES;

COMPUTATIONAL COMPLEXITY;

EID: 4544310407     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007371     Document Type: Conference Paper

References (30)

1. N. Alon, L. Babai and A. Itai, A fast and simple randomized parallel algorithm for the maximal independent set problem, J. Algorithms 7(1986), 567-583.
2. th ACM STOC, ACM Press (2002), 232-239.
3. rd IEEE FOCS, Pittsburgh, IEEE (1992), 473-481. Also: J. of Algorithms 16 (1994), 80-109.
4. rd IEEE FOCS, Pittsburgh, IEEE (1992), 473-481. Also: J. of Algorithms 16 (1994), 80-109.
5. th ACM STOC, ACM Press (1996), 20-29. Also; J. Comp. Sys. Sci. 58 (1999), 137-147.
6. th ACM STOC, ACM Press (1996), 20-29. Also; J. Comp. Sys. Sci. 58 (1999), 137-147.
7. N. Alon and J. Spencer, The Probabilistic Method, Second Edition, Wiley, New York, 2000.
8. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof verification and intractability of approximation problems, Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, 1992, 14-23.
9. J. Diestel, H. Jarchow and A. Tonge, Absolutely Summing Operators, Cambridge University Press, Cambridge, 1995.
10. A. M. Frieze and R. Kannan, Quick Approximation to matrices and applications, Combinatorica 19 (2) (1999) pp 175-200.
11. 2 Rounding Technique for Semidefinite Programs, Proceedings of the 28th International Colloquium on Automata, Languages and Programming, Crete, Greece, 2001, 213-224.
12. M. Grötschel, L. Lovász and A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica 1 (1981), 169-197.
13. A. Grothendieck, Résumé de la théorie métrique des produits tensoriels topologiques, Bol. Soc. Mat. Sao Paulo 8 (1953), 1-79.
14. M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum eut and satisfiability problems using semidefinite programming, J. ACM 42 (1995), 1115-1145.
15. U. Haagerup, A new upper bound for the complex Grothendieck constant, Israel J. Math. 60 (1987), 199-224.
16. J. Håstad, Some optimal inapproximability results, J. ACM 48 (2001), 798-859.
17. G. J. O. Jameson, Summing and nuclear norms in Banach space theory, London Mathematical Society Student Texts, 8, Cambridge University Press, Cambridge, 1987.
18. W. B. Johnson and J. Lindenstrauss, Basic concepts in the geometry of Banach spaces, Handbook of the geometry of Banach spaces, Vol. I, 1-84, North-Holland, Amsterdam, 2001.
19. H. König, On the complex Grothendieck constant in the n-dimensional case, London Math. Soc. Lect. Notes 158 (1990), 181-198.
20. J. L. Krivine, Sur la constante de Grothendieck, C. R. Acad. Sci. Paris Ser. A-B 284 (1977), 445-446.
21. M. Lewin, D. Livnat and U. Zwick, Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems, Proceedings of the 9th Conference on Integer Programming and Combinatorial Optimization, Cambridge, Massachusetts, 2002, 67-82.
22. p-spaces and their applications, Studia Math. 29 (1968), 275-326.
23. S. Mahajan and H. Ramesh, Derandomizing approximation algorithms based on semidefinite programming, SIAM J. Comput. 28 (1999), 1641-1663.
24. Y. E. Nesterov, Semidefinite relaxation and nonconvex quadratic optimization, Optimization Methods and Software 9 (1998), 141-160.
25. C. H. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, J. Comp. Sys. Sci. 43 (1991), 425-440.
26. R. E. Rietz, A proof of the Grothendieck inequality, Israel J. Math. 19 (1974), 271-276.
27. E. Szemerédi, Regular partitions of graphs, in: Proc. Colloque Inter. CNRS (J. -C. Bermond, J. -C. Fournier, M. Las Vergnas and D. Sotteau eds.), 1978, 399-401.
28. A. Tanay, R. Sharan, M. Kupiec and R. Shamir, Revealing Modularity and Organization in the Yeast Molecular Network by Integrated Analysis of Highly Heterogeneous Genome-Wide Data, Proceedings of the National Academy of Sciences USA, 101 (2004), 2981-2986.
29. A. Tanay, R. Sharan and R. Shamir, Discovering Statistically Significant Biclusters in Gene Expression Data, Bioinformatics 18 (1) (2002), 136-144.
30. U. Zwick, Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems, Proceedings of the 31th Annual ACM Symposium on Theory of Computing (STOC), Atlanta, Georgia, 1999, 679-687.