Average-case analysis of a greedy algorithm for the 0/1 knapsack problem. (Q1811628)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1929385
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Average-case analysis of a greedy algorithm for the 0/1 knapsack problem. |
scientific article; zbMATH DE number 1929385 |
Statements
Average-case analysis of a greedy algorithm for the 0/1 knapsack problem. (English)
0 references
17 June 2003
0 references
0/1 knapsack
0 references
NP-hard
0 references
approximation algorithms
0 references
probabilistic analysis
0 references
0.8410870432853699
0 references
0.8408640027046204
0 references
0.8403069972991943
0 references
