A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem (Q1208445)

From MaRDI portal
Revision as of 16:24, 17 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
A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem
scientific article

    Statements

    title
    A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem (English)
    0 references
    author
    Silvano Martello
    0 references
    Paolo Toth
    0 references
    publication date
    16 May 1993
    0 references
    zbMATH DE Number
    166449
    0 references
    zbMATH Keywords
    greedy algorithms
    0 references
    subset-sum problem
    0 references
    approximation algorithm
    0 references
    0/1 knapsack problem
    0 references
    worst-case bound
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1208445&oldid=34103135"
    Powered by MediaWiki