A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem (Q1208445): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Worst-case analysis of greedy algorithms for the subset-sum problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3993418 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 16:24, 17 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem |
scientific article |
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
