Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems (Q1319674): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:07, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems |
scientific article |
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
