A fully polynomial approximation algorithm for the 0-1 knapsack problem (Q1159134)

From MaRDI portal
Revision as of 04:37, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A fully polynomial approximation algorithm for the 0-1 knapsack problem
scientific article

    Statements

    A fully polynomial approximation algorithm for the 0-1 knapsack problem (English)
    0 references
    0 references
    0 references
    1981
    0 references
    0-1 knapsack problem
    0 references
    polynomial epsilon-approximation algorithm
    0 references
    NP- complete problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references