A faster FPTAS for knapsack problem with cardinality constraint (Q5918631)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A faster FPTAS for knapsack problem with cardinality constraint |
scientific article; zbMATH DE number 7495116
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A faster FPTAS for knapsack problem with cardinality constraint |
scientific article; zbMATH DE number 7495116 |
Statements
A faster FPTAS for knapsack problem with cardinality constraint (English)
0 references
22 March 2022
0 references
