Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems (Q1319674): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Worst-Case Analysis of Heuristic Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Worst-case analysis of the differencing method for the partition problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reducibility among Combinatorial Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Heuristic algorithms for the multiple knapsack problem / rank | |||
Normal rank | |||
Latest revision as of 13:39, 22 May 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
