Pages that link to "Item:Q1084863"
From MaRDI portal
The following pages link to Parallel approximation schemes for subset sum and knapsack problems (Q1084863):
Displaying 9 items.
- Estimating the computational complexity of one variant of parallel realization of the branch-and-bound method for the knapsack problem (Q353698) (← links)
- Approximate algorithms for the Knapsack problem on parallel computers (Q757041) (← links)
- Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method (Q828198) (← links)
- An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem (Q852950) (← links)
- Parallel time and space upper-bounds for the subset-sum problem (Q955010) (← links)
- Parallel approximation schemes for subset sum and knapsack problems (Q1084863) (← links)
- Parallel approximation schemes for problems on planar graphs (Q1924999) (← links)
- Hardness of approximation for knapsack problems (Q2345987) (← links)
- (Q3774941) (← links)