Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (Q2399291)

From MaRDI portal
Revision as of 06:54, 14 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions
scientific article

    Statements

    Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (English)
    0 references
    0 references
    0 references
    22 August 2017
    0 references
    binary packing
    0 references
    quadratic constraint
    0 references
    approximation algorithm
    0 references
    completely positive rank
    0 references
    nonnegative rank
    0 references
    submodular
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers