A faster FPTAS for the subset-sums ratio problem (Q1791024)
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 the subset-sums ratio problem |
scientific article; zbMATH DE number 6946820
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A faster FPTAS for the subset-sums ratio problem |
scientific article; zbMATH DE number 6946820 |
Statements
A faster FPTAS for the subset-sums ratio problem (English)
0 references
4 October 2018
0 references
approximation scheme
0 references
subset-sums ratio
0 references
knapsack problems
0 references
combinatorial optimization
0 references
