A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem (Q1198054)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem |
scientific article; zbMATH DE number 92113
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem |
scientific article; zbMATH DE number 92113 |
Statements
A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem (English)
0 references
16 January 1993
0 references
approximation algorithm
0 references
Non-Increasing First Fit greedy algorithm
0 references
\(0/1\) knapsack problem
0 references
