Computing the Grothendieck constant of some graph classes

  title={Computing the Grothendieck constant of some graph classes},
  author={Monique Laurent and Antonios Varvitsiotis},
  journal={Oper. Res. Lett.},

Figures and Tables from this paper

Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization
A mathematical framework to relate the rank of the minimum-rank solution of the LMI problem to the sparsity of its underlying graph is developed and three graph-theoretic convex programs to obtain a low- rank solution are proposed.
Graph-theoretic algorithms for polynomial optimization problems
It is shown that every polynomial optimization problem admits a sparse representation whose SDP relaxation has a rank 1 or 2 solution.
Polynomial Optimization via Penalized Conic Relaxation
This paper revisits conic programming relaxations for the class of quadratically-constrained quadratic programs (QCQPs). We present penalty terms, whose incorporation into the objective of convex
Grothendieck‐Type Inequalities in Combinatorial Optimization
We survey connections of the Grothendieck inequality and its variants to combinatorial optimization and computational complexity. © 2011 Wiley Periodicals, Inc.
Rank-2 Matrix Solution for Semidefinite Relaxations of Arbitrary Polynomial Optimization Problems
This work shows that an arbitrary polynomial optimization has an equivalent formulation in the form of a sparse quadraticallyconstrained quadratic program (QCQP) whose SDP relaxation possesses a matrix solution with rank at most 2.
Combinatorial conditions for low rank solutions in semidefinite programming
This thesis investigates combinatorial conditions that guarantee the existence of low-rank optimal solutions to semidefinite programs and introduces a graph parameter called the extreme Gram dimension of a graph, which is upper bounded by the Gram dimension and closely related to the rank-constrained Grothendieck constant.


On the cut polytope
It is shown that inequalities associated with chordless cycles define facets of this polytope; moreover, for these inequalities a polynomial algorithm to solve the separation problem is presented.
Semidefinite Relaxations for Max-Cut
It is shown that the tightest relaxation is obtained when aplying the Lasserre construction to the node formulation of the max-cut problem, and the class L t of the graphs G for which Q t (G) is the cut polytope of G is shown to be closed under taking minors.
Combinatorial Properties and the Complexity of a Max-cut Approximation
It is shown that the bound behaves in a manner similar to the max-cut for the operations of switching, vertex splitting, contraction and decomposition, and it can be adjusted for branch and bound techniques.
On non-approximability for quadratic programs
These techniques yield an explicit instance for which the integrality gap is /spl Omega/ (log n/log log n), essentially answering one of the open problems of Alon et al.
The Grothendieck Constant is Strictly Smaller than Krivine's Bound
The classical Grothendieck constant, denoted $K_G$, is equal to the integrality gap of the natural semi definite relaxation of the problem of computing$$\max \{\sum_{i=1}^m\sum_{j=1}^n a_{ij}
Quadratic forms on graphs
The lower bound for the complete graph improves a result of Kashin and Szarek on Gram matrices of uniformly bounded functions, and settles a problem of Megretski and of Charikar and Wirth.
On the Shannon capacity of a graph
  • L. Lovász
  • Mathematics, Computer Science
    IEEE Trans. Inf. Theory
  • 1979
It is proved that the Shannon zero-error capacity of the pentagon is \sqrt{5} and a well-characterized, and in a sense easily computable, function is introduced which bounds the capacity from above and equals the capacity in a large number of cases.
Geometry of cuts and metrics
This book draws from the interdisciplinarity of these fields as it gathers methods and results from polytope theory, geometry of numbers, probability theory, design and graph theory around two objects, cuts and metrics.
Approximating the cut-norm via Grothendieck's inequality
The problem of approximating the cut-norm of a given real matrix is MAX SNP hard, and the algorithm combines semidefinite programming with a rounding technique based on Grothendieck's Inequality to provide an efficient approximation algorithm.