A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem (Q1208445)
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 note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem |
scientific article; zbMATH DE number 166449
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem |
scientific article; zbMATH DE number 166449 |
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
0.96372336
0 references
0.9043878
0 references
0.89330316
0 references
0.89206517
0 references
0.8908919
0 references
0.8901131
0 references
0.88907963
0 references
