Faster FPTASes for counting and random generation of knapsack solutions (Q2417856)
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 7060935
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster FPTASes for counting and random generation of knapsack solutions |
scientific article; zbMATH DE number 7060935 |
Statements
Faster FPTASes for counting and random generation of knapsack solutions (English)
0 references
29 May 2019
0 references
0/1 knapsack problem
0 references
approximation algorithm
0 references
counting problem
0 references
sampling
0 references
dynamic programming
0 references
directed acyclic graph
0 references
0 references
0.9865444898605348
0 references
0.8617425560951233
0 references
0.8419321775436401
0 references
0.8391532301902771
0 references
