Pages that link to "Item:Q852950"
From MaRDI portal
The following pages link to An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem (Q852950):
Displaying 9 items.
- Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method (Q828198) (← links)
- Parallel time and space upper-bounds for the subset-sum problem (Q955010) (← links)
- Observations on optimal parallelizations of two-list algorithm (Q991072) (← links)
- Parallel approximation schemes for subset sum and knapsack problems (Q1084863) (← links)
- A polynomial approximation scheme for the subset sum problem (Q1346700) (← links)
- A low-space algorithm for the subset-sum problem on GPU (Q1652299) (← links)
- An improved balanced algorithm for the subset-sum problem (Q1713739) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- (Q3774941) (← links)