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.026zbMath1125.90043OpenAlexW2096100178MaRDI QIDQ852950
Carlos Alberto Alonso Sanches, Horacio Hideki Yanasse, Nei Yoshihiro Soma
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
Related Items (6)
A polynomial approximation scheme for the subset sum problem ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ A low-space algorithm for the subset-sum problem on GPU ⋮ An improved balanced algorithm for the subset-sum problem ⋮ Parallel time and space upper-bounds for the subset-sum problem ⋮ Observations on optimal parallelizations of two-list algorithm
Cites Work
- Fast and scalable parallel algorithms for knapsack-like problems.
- A parallel two-list algorithm for the knapsack problem
- Comments on parallel algorithms for the knapsack problem.
- A Parallel Algorithm for the Knapsack Problem
- Parallel Merge Sort
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- Parallel permutation and sorting algorithms and a new generalized connection network
- Computing Partitions with Applications to the Knapsack Problem
- A parallel time/hardware tradeoff T.H=O(2/sup n/2/) for the knapsack problem
- Discrete-Variable Extremum Problems
- An exact algorithm for the subset sum problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem
