A faster FPTAS for knapsack problem with cardinality constraint (Q5970810)
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 7516297
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A faster FPTAS for knapsack problem with cardinality constraint |
scientific article; zbMATH DE number 7516297 |
Statements
A faster FPTAS for knapsack problem with cardinality constraint (English)
0 references
29 April 2022
0 references
knapsack problem
0 references
1.5-dimensional
0 references
FPTAS
0 references
faster
0 references
0 references
0.8430805206298828
0 references
0.8336628675460815
0 references
