A semidefinite approach to the $K_i$-cover problem (Q1667210): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: \(K_ i\)-covers. I: Complexity and polytopes / 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: A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theta Bodies for Polynomial Ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chapter 7: Spectrahedral Approximations of Convex Hulls of Algebraic Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stability theorem on fractional covering of triangles by edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Tuza about packing and covering of triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope / 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: A conjecture on triangles of graphs / rank
 
Normal rank

Latest revision as of 11:10, 16 July 2024

scientific article
Language Label Description Also known as
English
A semidefinite approach to the $K_i$-cover problem
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references