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

Theoretical Computer Science

Volumn 407, Issue 1-3, 2008, Pages 342-348

  Sanches, C A A ^a   Soma, N Y ^a   Yanasse, H H ^b  

^a ITA   (Brazil)

^b INSTITUTO NACIONAL DE PESQUISAS ESPACIAIS   (Brazil)

Author keywords

Dynamic programming; Knapsack problem; Parallel algorithms; Subset sum problem; Upper bound complexity

Indexed keywords

DYNAMIC PROGRAMMING; KNAPSACK PROBLEM; SUBSET-SUM PROBLEM; UPPER-BOUND COMPLEXITY;

PARALLEL ALGORITHMS;

EID: 53249109366     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.06.051     Document Type: Article

References (19)

1. Akl S.G. The Design and Analysis of Parallel Algorithms (1989), Prentice-Hall, Englewood Cliffs, NJ
2. K.E. Batcher, Sorting networks and their applications, in: Proceedings of AFIS 1968 SJCC, 32, Montvale, NJ, 1968, pp. 307-314
3. Bellman R.E. Dynamic Programming (1957), Princeton University Press, Princeton
4. Chung, and Vijaya. A randomized linear-work EREW PRAM algorithm to find a minimum spanning forest. Algorithmica 35 (2003) 257-268
5. Cole R. Parallel merge sort. SIAM J. Comput. 17 (1988) 770-785
6. Datta A.K., and Sen R.K. o (log n) time parallel maximal matching algorithm using linear number of processors. Parallel Algorithms and Applications 19 (2004) 19-32
7. Goldman A., and Trystram D. An efficient parallel algorithm for solving the knapsack problem on hypercubes. Journal of Parallel and Distributed Computing 64 (2004) 1213-1222
8. P.S. Gopalakrishnam, I.V. Ramakrishnam, L.N. Kanal, Parallel approximate algorithms for the 0-1 knapsack problem, in: Proceedings of International Conference on Parallel Processing, 1986, pp. 444-451
9. Horowitz E., and Sahni S. Computing partitions with applications to the knapsack problem. Journal of ACM (1974) 277-292
10. Kellerer H., Pferschy U., and Pisinger D. Knapsack Problems (2004), Springer
11. Kindervater G.A.P., and Lenstra J.K. An introduction to parallelism in combinatorial optimization. Discrete Applied Mathematics 14 (1986) 135-156
12. Lee J., Shragowitz E., and Sahni S. A hypercube algorithm for the 0/1 knapsack problem. Journal of Parallel and Distributed Computing 5 (1988) 438-456
13. Lin J., and Storer J. Processor efficient hypercube algorithm for the knapsack problem. Journal of Parallel and Distributed Computing 3 (1991) 332-337
14. E.W. Mayr, Parallel approximation algorithms, in: Proceedings of International Conference on Fifth Generation Computer Systems, 1988, pp. 542-551
15. Rajasekaran S. Efficient parallel hierarchical clustering algorithms. IEEE Transactions on Parallel and Distributed Systems 16 (2005) 497-502
16. Sanches C.A.A., Soma N.Y., and Yanasse H.H. An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem. European Journal of Operational Research 176 (2007) 870-879
17. Soma N.Y., and Toth P. An exact algorithm for the subset sum problem. European Journal of Operational Research 136 (2002) 57-66
18. Teng S. Adaptive parallel algorithms for integral knapsack problems. Journal of Parallel and Distributed Computing 8 (1990) 400-406
19. Wang Y.R., and Horng S.J. An O(1) time algorithm for the 3D Euclidean distance transform on the CRCW PRAM model. IEEE Transactions on Parallel and Distributed Systems 14 (2003) 973-982