Pages that link to "Item:Q1822965"
From MaRDI portal
The following pages link to A new linear storage, polynomial-time approximation scheme for the subset-sum problem (Q1822965):
Displaying 6 items.
- A polynomial approximation scheme for the subset sum problem (Q1346700) (← links)
- An efficient fully polynomial approximation scheme for the Subset-Sum problem. (Q1400576) (← links)
- Approximation algorithms for knapsack problems with cardinality constraints (Q1569936) (← links)
- A new fully polynomial time approximation scheme for the interval subset sum problem (Q1675574) (← links)
- Two linear approximation algorithms for the subset-sum problem (Q1969831) (← links)
- Techniques for solving subset sum problems within a given tolerance (Q3410169) (← links)