A new fully polynomial time approximation scheme for the interval subset sum problem (Q1675574)
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 6802513
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new fully polynomial time approximation scheme for the interval subset sum problem |
scientific article; zbMATH DE number 6802513 |
Statements
A new fully polynomial time approximation scheme for the interval subset sum problem (English)
0 references
2 November 2017
0 references
interval subset sum problem
0 references
computational complexity
0 references
solution structure
0 references
fully polynomial time approximation scheme
0 references
worst-case performance
0 references
0.8471781611442566
0 references
0.8302192687988281
0 references
0.8272914290428162
0 references
0.8077438473701477
0 references
