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 条

[41] UPPER-BOUNDS FOR TIME-SPACE TRADE-OFFS IN SORTING AND SELECTION
FREDERICKSON, GN
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1987, 34 (01) : 19 - 26
[42] SUBSET COMPLEMENT ADDITION UPPER-BOUNDS - AN IMPROVED INCLUSION EXCLUSION METHOD
HOOVER, DR
JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 1990, 24 (02) : 195 - 202
[43] A HEURISTIC ALGORITHM FOR A NETWORK PROBLEM WITH VARIABLE UPPER-BOUNDS
SHETTY, B
NETWORKS, 1990, 20 (04) : 373 - 389
[44] An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem
Sanches, C. A. A.
Soma, N. Y.
Yanasse, H. H.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 176 (02) : 870 - 879
[45] A MIXTURE OF DYNAMIC-PROGRAMMING AND BRANCH-AND-BOUND FOR THE SUBSET-SUM PROBLEM
MARTELLO, S
TOTH, P
MANAGEMENT SCIENCE, 1984, 30 (06) : 765 - 771
[46] Efficient CPU-GPU cooperative computing for solving the subset-sum problem
Wan, Lanjun
Li, Kenli
Liu, Jing
Li, Keqin
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2016, 28 (02): : 492 - 516
[47] An Implementation of Space-Time Tradeoff Method for Subset Sum Problem
Mine, Takumi
Murakami, Yasuyuki
2011 6TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCES AND CONVERGENCE INFORMATION TECHNOLOGY (ICCIT), 2012, : 618 - 621
[48] Upper Bounds for the Sensor Subset Selection Problem
Ghassemi, Farhad
Krishnamurthy, Vikram
FUSION: 2009 12TH INTERNATIONAL CONFERENCE ON INFORMATION FUSION, VOLS 1-4, 2009, : 110 - 117
[49] LOWER AND UPPER-BOUNDS ON TIME FOR MULTIPROCESSOR OPTIMAL SCHEDULES
JAIN, KK
RAJARAMAN, V
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1994, 5 (08) : 879 - 886
[50] FICTITIOUS UPPER-BOUNDS IN AN ALGORITHM FOR THE SYMMETRIC TRAVELING SALESMAN PROBLEM
VOLGENANT, T
JONKER, R
COMPUTERS & OPERATIONS RESEARCH, 1990, 17 (01) : 113 - 117

← 1 2 3 4 5 →