Approximating the Quadratic Knapsack Problem on Special Graph Classes (Q3188866)

From MaRDI portal
Revision as of 21:57, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Approximating the Quadratic Knapsack Problem on Special Graph Classes
scientific article

    Statements

    Approximating the Quadratic Knapsack Problem on Special Graph Classes (English)
    0 references
    0 references
    0 references
    2 September 2014
    0 references
    quadratic knapsack problem
    0 references
    densest \(k\)-subgraph
    0 references
    approximation algorithm
    0 references
    \(H\)-minor free
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references