Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems (Q1319674)
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: Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems |
scientific article; zbMATH DE number 550410
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems |
scientific article; zbMATH DE number 550410 |
Statements
Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems (English)
0 references
12 April 1994
0 references
NP-hardness
0 references
greedy algorithm
0 references
worst-case performance ratio
0 references
unbounded knapsack problem
0 references
subset-sum problem
0 references
partition problem
0 references
