Observations on optimal parallelizations of two-list algorithm

DOI10.1016/J.PARCO.2009.09.005MaRDI QIDQ991072zbMATH OpenOpenAlexFDO

Authors Carlos Alberto Alonso Sanches, Nei Yoshihiro Soma, Horacio Hideki Yanasse

Publication date 2 September 2010

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.parco.2009.09.005

zbMATH Keywords

parallel algorithmknapsack problemsubset-sum problemtwo-list algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Parallel algorithms in computer science (68W10)

Recommendations

• An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem
• Comments on parallel algorithms for the knapsack problem.
• A parallel two-list algorithm for the knapsack problem
• scientific article; zbMATH DE number 2075843
• The two list algorithm for the knapsack problem on an FPS T20

Cites work

• A parallel two-list algorithm for the knapsack problem
• An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem
• Comments on parallel algorithms for the knapsack problem.
• Computing Partitions with Applications to the Knapsack Problem

Cited in

(2)

• An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem
• Comments on parallel algorithms for the knapsack problem.

This page was built for publication: Observations on optimal parallelizations of two-list algorithm

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