A new fully polynomial time approximation scheme for the Knapsack problem (Q1304384): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
CorrectionBot (talk | contribs)
Changed label, description and/or aliases in en, and other parts
 
description / endescription / en
scientific article
scientific article; zbMATH DE number 1339728

Latest revision as of 23:17, 16 July 2025

scientific article; zbMATH DE number 1339728
Language Label Description Also known as
English
A new fully polynomial time approximation scheme for the Knapsack problem
scientific article; zbMATH DE number 1339728

    Statements

    A new fully polynomial time approximation scheme for the Knapsack problem (English)
    0 references
    0 references
    0 references
    22 September 1999
    0 references
    knapsack problem
    0 references
    fully polynomial approximation scheme
    0 references

    Identifiers