A faster FPTAS for the unbounded knapsack problem (Q1678097)
From MaRDI portal
scientific article; zbMATH DE number 6562491
- A Faster FPTAS for the Unbounded Knapsack Problem
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A faster FPTAS for the unbounded knapsack problem |
scientific article; zbMATH DE number 6562491 |
|
Statements
A faster FPTAS for the unbounded knapsack problem (English)
0 references
A Faster FPTAS for the Unbounded Knapsack Problem (English)
0 references
14 November 2017
0 references
4 April 2016
0 references
polynomial time approximation
0 references
Unbounded Knapsack Problem, approximation schemes
0 references
0 references
0 references
