Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope (Q740647): 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: W2129434754 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1205.2040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic forms on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizability of graphs in three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicities of eigenvalues and tree-width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms and Semidefinite Programming / 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: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral characterization of tree-width-two graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree width and regular triangulations / 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: Q3601990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Facial Structure of the Set of Correlation Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive semidefinite matrix completion, universal rigidity and the strong Arnold property / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Extreme Correlation Matrices / 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: Q4410018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal algorithms for unique games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations and algebraic optimization in control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two tree-width-like graph invariants / rank
 
Normal rank

Latest revision as of 23:28, 8 July 2024

scientific article
Language Label Description Also known as
English
Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope
scientific article

    Statements

    Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope (English)
    0 references
    4 September 2014
    0 references
    matrix completion
    0 references
    semidefinite programming
    0 references
    correlation matrix
    0 references
    gram representation
    0 references
    graph minor
    0 references
    tree-width
    0 references
    Grothendieck constant
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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