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

被引：12
|
作者：
Sanches, C. A. A. [1 ]
Soma, N. Y. [1 ]
Yanasse, H. H. [2 ]
机构：
[1] ITA, BR-12228900 Sao Jose Dos Campos, SP, Brazil
[2] INPE, Sao Jose Dos Campos, Brazil
来源：
THEORETICAL COMPUTER SCIENCE | 2008年 / 407卷 / 1-3期
基金：
巴西圣保罗研究基金会;
关键词：
Subset-sum problem; Knapsack problem; Parallel algorithms; Dynamic programming; Upper-bound complexity;
D O I：
10.1016/j.tcs.2008.06.051
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Three new parallel scalable algorithms for solving the Subset-Sum Problem in O(n/p(c - w(min))) time and O(n + c) space in the PRAM model are presented, where n is the number of objects, c is the capacity, w(min) 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. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码：342 / 348
页数：7
相关论文
共 50 条
12345