Pages that link to "Item:Q1319674"
From MaRDI portal
The following pages link to Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems (Q1319674):
Displayed 6 items.
- Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations (Q1125006) (← links)
- A linear compound algorithm for uniform machine scheduling (Q1266304) (← links)
- Two linear approximation algorithms for the subset-sum problem (Q1969831) (← links)
- Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem (Q1977259) (← links)
- (Q4526868) (← links)
- On the Complexity of Minimizing the Total Calibration Cost (Q4632198) (← links)