Pages that link to "Item:Q1089266"
From MaRDI portal
The following pages link to Worst-case analysis of an approximation scheme for the subset-sum problem (Q1089266):
Displaying 8 items.
- A tight analysis and near-optimal instances of the algorithm of Anderson and Woll (Q706634) (← links)
- Approximation schemes for the subset-sum problem: Survey and experimental analysis (Q1069445) (← links)
- A polynomial approximation scheme for the subset sum problem (Q1346700) (← links)
- A new linear storage, polynomial-time approximation scheme for the subset-sum problem (Q1822965) (← links)
- Two linear approximation algorithms for the subset-sum problem (Q1969831) (← links)
- Constant time approximation scheme for largest well predicted subset (Q2377379) (← links)
- Worst-case analysis of the differencing method for the partition problem (Q3750527) (← links)
- Worst case analysis of two heuristics for the set partitioning problem (Q3774940) (← links)