Parallel time and space upper-bounds for the subset-sum problem

Authors:
C. A. A. Sanches;N. Y. Soma;H. H. Yanasse
Affiliations:
ITA, Brazil;ITA, Brazil;INPE, Brazil
Venue:
Theoretical Computer Science
Year:
2008

Citing 9
Cited 1

An introduction to parallelism in combinatorial optimization

Discrete Applied Mathematics
A hypercube algorithm for the 0/1 knapsack problem

Journal of Parallel and Distributed Computing
Parallel merge sort

SIAM Journal on Computing
The design and analysis of parallel algorithms

The design and analysis of parallel algorithms
Adaptive parallel algorithms for integral knapsack problems

Journal of Parallel and Distributed Computing - Special issue: algorithms for hypercube computers
Computing Partitions with Applications to the Knapsack Problem

Journal of the ACM (JACM)
Dynamic Programming

Dynamic Programming
An efficient parallel algorithm for solving the Knapsack problem on hypercubes

Journal of Parallel and Distributed Computing
Efficient Parallel Hierarchical Clustering Algorithms

IEEE Transactions on Parallel and Distributed Systems

Parallel solution of the subset-sum problem: an empirical study

Concurrency and Computation: Practice & Experience

Quantified Score

Hi-index	5.23

Visualization

Abstract

Three new parallel scalable algorithms for solving the Subset-Sum Problem in O(np(c-w"m"i"n)) time and O(n+c) space in the PRAM model are presented, where n is the number of objects, c is the capacity, w"m"i"n is the smallest weight and p is the number of processors. These time and space bounds are better than the direct parallelization of Bellman's algorithm, which was the most efficient known result.