Approximating the cut-norm via grothendieck's inequality

SIAM Journal on Computing

Volumn 35, Issue 4, 2006, Pages 787-803

  Alon, Noga ^a   Naor, Assaf ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Approximation algorithms; Cut norm; Grothendieck's inequality; Semidefinite programming; Szemer di partitions

Indexed keywords

APPROXIMATION ALGORITHMS; CUT-NORM; GROTHENDIECK'S INEQUALITY; SEMIDEFINITE PROGRAMMING; SZEMERÉDI PARTITIONS;

ALGORITHMS; GRAPH THEORY; MATRIX ALGEBRA; PROBLEM SOLVING;

APPROXIMATION THEORY;

EID: 33747188137     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539704441629     Document Type: Conference Paper

References (28)

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), pp. 567-583.
2. N. ALON, W. F. DE LA VEGA, R. KANNAN, AND M. KARPINSKI, Random sampling and approximation of MAX-CSP problems, in Proceedings of the 34th ACM Symposium on Theory of Computing, ACM Press, New York, 2002, pp. 232-239.
3. N. ALON, R. A. DUKE, H. LEFMANN, V. RÖDL, AND R. YUSTER, The algorithmic aspects of the regularity lemma, J. Algorithms, 16 (1994), pp. 80-109.
4. N. ALON, Y. MATIAS, AND M. SZEGEDY, The space complexity of approximating the frequency moments, J. Comput. System Sci., 58 (1999), pp. 137-147.
5. N. ALON AND J. SPENCER, The Probabilistic Method, 2nd ed., Wiley, New York, 2000.
6. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, AND M. SZEGEDY, Proof verification and intractability of approximation problems, J. ACM, 45 (1998), pp. 501-555.
7. J. DIESTEL, H. JARCHOW, AND A. TONGE, Absolutely Summing Operators, Cambridge University Press, Cambridge, UK, 1995.
8. A. M. FRIEZE AND R. KANNAN, Quick approximation to matrices and applications, Combinatorica, 19 (1999), pp. 175-200.
9. 2 rounding technique for semidefinite programs, in Proceedings of the 28th International Colloquium on Automata, Languages and Programming, Crete, Greece, 2001, pp. 213-224.
10. M. GRÖTSCHEL, L. LOVáSZ, AND A. SCHRIJVER, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica, 1 (1981), pp. 169-197.
11. A. GROTHENDIECK, Résumé de la théorie mẽtrique des produits tensoriels topologiques, Bol. Soc. Mat. São Paulo, 8 (1953), pp. 1-79.
12. M. X. GOEMANS AND D. P. WILLIAMSON, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM, 42 (1995), pp. 1115-1145.
13. U. HAAGERUP, A new upper bound for the complex Grothendieck constant, Israel J. Math., 60 (1987), pp. 199-224.
14. J. HÅSTAD, Some optimal inapproximability results, J. ACM, 48 (2001), pp. 798-859.
15. G. J. O. JAMESON, Summing and Nuclear Norms in Banach Space Theory, London Math. Soc. Stud. Texts 8, Cambridge University Press, Cambridge, UK, 1987.
16. W. B. JOHNSON AND J. LINDENSTRAUSS, Basic concepts in the geometry of Banach spaces, in Handbook of the Geometry of Banach Spaces, Vol. I, North-Holland, Amsterdam, 2001, pp. 1-84.
17. H. KÖNIG, On the complex Grothendieck constant in the n-dimensional case, in Geometry of Banach Spaces, London Math. Soc. Lecture Note Ser. 158, P. F. X. Muller and W. Schachermayer, eds., Cambridge University Press, Cambridge, UK, 1990, pp. 181-198.
18. J. L. KRIVINE, Sur la constante de Grothendieck, C. R. Acad. Sci. Paris Sér. A-B, 284 (1977), pp. 445-446.
19. M. LEWIN, D. LIVNAT, AND U. ZWICK, Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems, in Proceedings of the 9th Conference on Integer Programming and Combinatorial Optimization, Cambridge, MA, 2002, pp. 67-82.
20. p-spaces and their applications, Studia Math., 29 (1968), pp. 275-326.
21. S. MAHAJAN AND H. RAMESH, Derandomizing approximation algorithms based on semidefinite programming, SIAM J. Comput., 28 (1999), pp. 1641-1663.
22. Y. E. NESTEROV, Semidefinite relaxation and nonconvex quadratic optimization, Optim. Methods Softw., 9 (1998), pp. 141-160.
23. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, Optimization, approximation, and complexity classes, 3. Comput. System Sci., 43 (1991), pp. 425-440.
24. R. E. RIETZ, A proof of the Grothendieck inequality, Israel J. Math., 19 (1974), pp. 271-276.
25. E. SZEMERÉDI, Regular partitions of graphs, in Problémes combinatoires et théorie des graphes, Colloq. Internat. CNRS 260, J.-C. Bermond, J.-C. Fournier, M. Las Vergnas, and D. Sotteau, eds., CNRS, Paris, 1978, pp. 399-401.
26. 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, Proc. Nat. Acad. Sci. USA, 101 (2004), pp. 2981-2986.
27. A. TANAY, R. SHARAN, AND R. SHAMIR, Discovering statistically significant biclusters in gene expression data, Bioinformatics, 18 (2002), pp. 136-144.
28. U. ZWICK, Outward rotations: A tool for rounding solutions of semidefinite programming relaxations, with applications to MAX CUT and other problems, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, Atlanta, GA, 1999, pp. 679-687.