An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem
From MaRDI portal
Publication:852950
DOI10.1016/J.EJOR.2005.09.026zbMATH Open1125.90043OpenAlexW2096100178MaRDI QIDQ852950FDOQ852950
Authors: Carlos Alberto Alonso Sanches, Nei Yoshihiro Soma, Horacio Hideki Yanasse 
Publication date: 15 November 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.026
Recommendations
- Parallel time and space upper-bounds for the subset-sum problem
- scientific article; zbMATH DE number 4035132
- Observations on optimal parallelizations of two-list algorithm
- Parallel approximation schemes for subset sum and knapsack problems
- Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing Partitions with Applications to the Knapsack Problem
- Parallel Merge Sort
- Discrete-variable extremum problems
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- Title not available (Why is that?)
- Parallel permutation and sorting algorithms and a new generalized connection network
- Fast and scalable parallel algorithms for knapsack-like problems.
- Comments on parallel algorithms for the knapsack problem.
- A parallel two-list algorithm for the knapsack problem
- A Parallel Algorithm for the Knapsack Problem
- A parallel time/hardware tradeoff T.H=O(2/sup n/2/) for the knapsack problem
- An exact algorithm for the subset sum problem
Cited In (9)
- Parallel time and space upper-bounds for the subset-sum problem
- Effective parallelization strategy for the solution of subset sum problems by the branch-and-bound method
- Title not available (Why is that?)
- Observations on optimal parallelizations of two-list algorithm
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- A low-space algorithm for the subset-sum problem on GPU
- A polynomial approximation scheme for the subset sum problem
- Parallel approximation schemes for subset sum and knapsack problems
- An improved balanced algorithm for the subset-sum problem
This page was built for publication: An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q852950)
