Computing the Grothendieck constant of some graph classes (Q408441): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2119747577 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1106.2735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic forms on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the cut-norm via Grothendieck's inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: The max-cut problem on graphs not contractible to \(K_ 5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cut polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: The real positive definite completion problem for a simple cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Grothendieck Constant is Strictly Smaller than Krivine's Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grothendieck inequalities for semidefinite programs with rank constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bell Inequalities, Grothendieck’s Constant, and Root Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3239535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The real positive semidefinite completion problem for series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Bell inequalities for the singlet state: Going beyond the Grothendieck bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial properties and the complexity of a max-cut approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The performance of an eigenvalue bound on the max-cut problem in some classes of graphs / rank
 
Normal rank

Latest revision as of 02:05, 5 July 2024

scientific article
Language Label Description Also known as
English
Computing the Grothendieck constant of some graph classes
scientific article

    Statements

    Computing the Grothendieck constant of some graph classes (English)
    0 references
    5 April 2012
    0 references
    0 references
    Grothendieck constant
    0 references
    elliptope
    0 references
    cut polytope
    0 references
    clique-web inequality
    0 references
    0 references
    0 references
    0 references
    0 references