Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems (Q1319674)

From MaRDI portal
Revision as of 13:39, 22 May 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
Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems
scientific article

    Statements

    Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems (English)
    0 references
    0 references
    12 April 1994
    0 references
    NP-hardness
    0 references
    greedy algorithm
    0 references
    worst-case performance ratio
    0 references
    unbounded knapsack problem
    0 references
    subset-sum problem
    0 references
    partition problem
    0 references

    Identifiers