Pages that link to "Item:Q3042877"
From MaRDI portal
The following pages link to Worst-case analysis of greedy algorithms for the subset-sum problem (Q3042877):
Displayed 12 items.
- Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem (Q819064) (← links)
- Approximation schemes for the subset-sum problem: Survey and experimental analysis (Q1069445) (← links)
- Worst-case analysis of an approximation scheme for the subset-sum problem (Q1089266) (← links)
- A new enumeration scheme for the knapsack problem (Q1095029) (← links)
- A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem (Q1208445) (← links)
- A polynomial approximation scheme for the subset sum problem (Q1346700) (← links)
- An efficient fully polynomial approximation scheme for the Subset-Sum problem. (Q1400576) (← 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)
- Average-case performance of rollout algorithms for knapsack problems (Q2349849) (← links)
- The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem (Q3354469) (← links)
- Dynamic scheduling of batch-processing machines with non-identical product sizes (Q5438667) (← links)