The following pages link to (Q3888846):
Displaying 7 items.
- Approximation schemes for the subset-sum problem: Survey and experimental analysis (Q1069445) (← links)
- Fast approximation algorithm for job sequencing with deadlines (Q1154384) (← 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 linear storage, polynomial-time approximation scheme for the subset-sum problem (Q1822965) (← links)
- On the complexity and approximation of the maximum expected value all-or-nothing subset (Q2192058) (← links)
- Worst-case analysis of greedy algorithms for the subset-sum problem (Q3042877) (← links)