Faster FPTASes for counting and random generation of knapsack solutions (Q2417856)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster FPTASes for counting and random generation of knapsack solutions |
scientific article |
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
