A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem (Q1198054): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Partha Pratim Chakrabarti / rank | |||
| Property / author | |||
| Property / author: Sujoy Ghose / rank | |||
| Property / author | |||
| Property / author: Partha Pratim Chakrabarti / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Sujoy Ghose / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximate Algorithms for the 0/1 Knapsack Problem / rank | |||
Normal rank | |||
Latest revision as of 15:35, 16 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem |
scientific article |
Statements
A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem (English)
0 references
16 January 1993
0 references
approximation algorithm
0 references
Non-Increasing First Fit greedy algorithm
0 references
\(0/1\) knapsack problem
0 references
