A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem (Q1208445): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:18, 31 January 2024
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
A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem (English)
0 references
16 May 1993
0 references
greedy algorithms
0 references
subset-sum problem
0 references
approximation algorithm
0 references
0/1 knapsack problem
0 references
worst-case bound
0 references
