scientific article; zbMATH DE number 4035132

MaRDI QIDQ3774941zbMATH OpenFDO

Authors

Publication date 1986

zbMATH Keywords

knapsack problemparallel algorithmparallel random access machinesubset sum problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Programming involving graphs or networks (90C35)

Recommendations

• Parallel time and space upper-bounds for the subset-sum problem
• An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem
• Parallel approximation schemes for subset sum and knapsack problems
• A near-linear pseudopolynomial time algorithm for subset sum
• A parallel algorithm for subset selection
• A parallel algorithm of complexity O(log 2 n) for the set balancing problem
• A fast bit-parallel algorithm for computing the subset partial order
• A parallel algorithm for the complexity of O(^ 2 n) for the set balancing problem
• Fast parallel algorithms for the maximum sum problem

Cited in

(5)

• Parallel approximation schemes for subset sum and knapsack problems
• A low-space algorithm for the subset-sum problem on GPU
• Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method
• An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem
• Parallel time and space upper-bounds for the subset-sum problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3774941)