By Topic

Adaptive and Cost-Optimal Parallel Algorithm for the 0-1 Knapsack Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Kenli Li ; Coll. of Comput. & Commun., Hunan Univ., Changsha, China ; Lingxiao Li ; Teklay Tesfazghi ; Edwin Hsing-Mean Sha

The 0-1 knapsack problem is well known to be NP-complete problem. In the past two decades, much effort has been done in order to find techniques that could lead to algorithms with a reasonable running time. This paper proposes a new parallel algorithm for the 0-1 knapsack problem where the optimal merging algorithm is adopted. Based on an EREW PRAM machine with shared memory, the proposed algorithm utilizes O((2n/4)1-e) processors, 0 ≤ ε ≤ 1, and O(2n/2) memory to find a solution for the n-element 0-1 knapsack problem in time O(2n/4(2n/4)e). Thus the cost of the proposed parallel algorithm is O(2n/2), which is both the lowest upper-bound time and without memory conflicts if only quantity of objects is considered in the complexity analysis for the 0-1 knapsack problem. Thus it is an improvement result over the past researches.

Published in:

2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing

Date of Conference:

9-11 Feb. 2011