The UGC hardness threshold of the ℓp Grothendieck problem
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms
Random Structures & Algorithms
An optimal sdp algorithm for max-cut, and equally optimal long code tests
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Towards computing the Grothendieck constant
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Max cut and the smallest eigenvalue
Proceedings of the forty-first annual ACM symposium on Theory of computing
Spectral methods for matrices and tensors
Proceedings of the forty-second ACM symposium on Theory of computing
The UGC Hardness Threshold of the Lp Grothendieck Problem
Mathematics of Operations Research
The positive semidefinite Grothendieck problem with rank constraint
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Simulating Quantum Correlations with Finite Communication
SIAM Journal on Computing
Approximate Hypergraph Partitioning and Applications
SIAM Journal on Computing
Bypassing UGC from some optimal geometric inapproximability results
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and hardness for subspace approximation
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Iterative constructions and private data release
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma
SIAM Journal on Discrete Mathematics
On quadratic programming with a ratio objective
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Zero-one rounding of singular vectors
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
On the complexity of Newman's community finding approach for biological and social networks
Journal of Computer and System Sciences
On solving biquadratic optimization via semidefinite relaxation
Computational Optimization and Applications
Most Tensor Problems Are NP-Hard
Journal of the ACM (JACM)
Domination analysis of algorithms for bipartite boolean quadratic programs
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Graph Partitioning by Correspondence Analysis and Taxicab Correspondence Analysis
Journal of Classification
Hi-index | 0.00 |
The cut-norm $||A||_C$ of a real matrix $A=(a_{ij})_{i\in R,j\in S}$ is the maximum, over all $I \subset R$, $J \subset S$, of the quantity $|\sum_{i \in I, j\in J} a_{ij}|$. This concept plays a major role in the design of efficient approximation algorithms for dense graph and matrix problems. Here we show that the problem of approximating the cut-norm of a given real matrix is MAX SNP hard, and we provide an efficient approximation algorithm. This algorithm finds, for a given matrix $A=(a_{ij})_{i\in R,j\in S}$, two subsets $I \subset R$ and $J \subset S$, such that $|\sum_{i \in I, j\in J} a_{ij}| \geq \rho ||A||_C$, where $\rho0$ is an absolute constant satisfying $\rho 0.56$. The algorithm combines semidefinite programming with a rounding technique based on Grothendieck's inequality. We present three known proofs of Grothendieck's inequality, with the necessary modifications which emphasize their algorithmic aspects. These proofs contain rounding techniques which go beyond the random hyperplane rounding of Goemans and Williamson [J. ACM, 42 (1995), pp. 1115-1145], allowing us to transfer various algorithms for dense graph and matrix problems to the sparse case.