Improved dynamic programming in connection with an FPTAS for the knapsack problem (Q1768594)

From MaRDI portal
Revision as of 01:20, 27 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Improved dynamic programming in connection with an FPTAS for the knapsack problem
scientific article

    Statements

    Improved dynamic programming in connection with an FPTAS for the knapsack problem (English)
    0 references
    0 references
    0 references
    15 March 2005
    0 references
    dynamic programming
    0 references
    knapsack problem
    0 references
    fully polynomial approximation scheme
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references