Average-case analysis of a greedy algorithm for the 0/1 knapsack problem. (Q1811628)

From MaRDI portal
Revision as of 21:55, 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
Average-case analysis of a greedy algorithm for the 0/1 knapsack problem.
scientific article

    Statements

    Average-case analysis of a greedy algorithm for the 0/1 knapsack problem. (English)
    0 references
    0 references
    0 references
    17 June 2003
    0 references
    0/1 knapsack
    0 references
    NP-hard
    0 references
    approximation algorithms
    0 references
    probabilistic analysis
    0 references

    Identifiers