Fast and scalable parallel algorithms for knapsack-like problems

Journal of Parallel and Distributed Computing

Volumn 39, Issue 1, 1996, Pages 1-13

  Ferreira, Afonso ^a   Robson, John Michael ^b  

^a UNIVERSITÉ DE LYON   (France)

^b UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030602139     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1996.0150     Document Type: Article

References (32)

1. 1. Ahrens, J. H., and Finke, G. Merging and sorting applied to the zero-one knapsack problem. Oper. Res. 23, 6 (1975), 1099-1109.
2. 2. Akl, S. G. Parallel Sorting Algorithms. Academic Press, San Diego, 1985.
3. 3. Amirazizi, H. R., and Hellman. M. E. Time-memory-processor tradeoffs. IEEE Trans. Inform. Theory 34, 3 (1988), 505-512.
4. 4. Batcher, K. E. Sorting networks and their applications. Proceedings AFIPS Spring Joint Computer Conference, 1968, Vol. 32, pp. 307-314.
5. n/2). Int. J. High Speed Comput. 4, 2 (1992), 109-120.
6. 6. Cosnard, M., Duprat, J., and Ferreira, A. Known and new results on selection, sorting and searching in X + Y and sorted matrices. Technical Report 89-9, LIP-IMAG, Sept. 1989.
7. 7. Cosnard, M., Duprat, J., and Ferreira, A. The complexity of searching in X + Y and other multisets. Inform. Process. Lett. 34 (1990), 103-109.
8. 8. Cosnard, M., and Ferreira, A. Parallel algorithms for searching in X + Y. In Ris, F., and Kogge, P. M. (Eds.). Proceedings of the International Conference on Parallel Processing 89, Vol. 3, Algorithms and Applications. Penn State Univ. Press, 1989, pp. 16-19.
9. 9. Cypher, R. E., and Plaxton, C. G. Deterministic sorting in nearly logarithmic time on the hypercube and related computers. Proceedings of 15th Annual ACM Symposium on Theory of Computing. 1990, pp. 193-203.
10. n/2) for the knapsack problem. IEEE Trans. Comput. 40, 2 (1991), 221-225.
11. 11. Ferreira, A. Parallel search in sorted multisets, and NP-complete problems. In Baeza-Yates, R., and Manber, U. (Eds.). Computer Science-Research and Applications. Plenum, New York/London, 1992, pp. 383-394.
12. 12. Ferreira, A. Work and memory efficient parallel algorithms for the knapsack problem. Int. J. High Speed Comput. 4 (1995).
13. 13. Ferreira, A. Parallel and communication algorithms for hypercube multiprocessors. In Zomaya, A. (Ed.). Handbook of Parallel and Distributed Computing, McGraw-Hill, New York, 1996.
14. 14. Ferris, M. C. Parallel solution of extremely large knapsack problems. Technical Report 842, CSD-University of Wisconsin-Madison, Apr. 1989.
15. 15. Frederickson, G. N., and Johnson, D. B. The complexity of selection and ranking in X + Y and matrices with sorted columns. J. Comput. System Sci. 24 (1982), 197-208.
16. 16. Frederickson, G. N., and Johnson, D. B. Generalized selection and ranking: Sorted matrices. SIAM J. Comput. 1, 13 (1984), 14-30.
17. 17. Fredman, M. L. Two applications of a probabilistic search technique: Sorting X + Y and building balanced search trees. In Proceedings 7th Annual ACM Symp. on Theory of Computing. 1975, pp. 240-244.
18. 18. Gonnet, G. H., and Munro, J. I. Heaps on heaps. SIAM J. Comput. 4, 15 (1986), 964-971.
19. 19. Harper, L. H., Payne, T. H., Savage, J. E., and Straus. E. Sorting X + Y. Comm. ACM 6, 18 (1975), 347-349.
20. 20. Horowitz, E., and Sahni, S. Computing partitions with applications to the knapsack problem. J. Assoc. Comput. Mech. 21,2 (1974), 277-292.
21. 21. Karnin, E. D. A parallel algorithm for the knapsack problem. IEEE Trans. Comput. C-33, 5 (1984), 404-408.
22. 2) comparisons. Proceedings of STACS 90. Rouen, France, 1990.
23. 23. Linial, N., and Saks, M. Searching ordered structures. J. Algorithms 6 (1985), 86-103.
24. 24. Martello, S., and Toth, P. Knapsack Problems: Algorithms and Computer Implementations. Wiley, New York, 1990.
25. 25. McDiarmid, C. J. H., and Reed, B. A. Building heaps fast. J. Algorithms 10 (1989), 352-365.
26. 26. Mirzaian, A. Channel routing in VLSI. Proceedings of the 16th Annual ACM Symposium on Theory of Computing. Washington, D.C., 1984, pp. 101-107.
27. 27. Mirzaian, A., and Arjomandi, E. Selection in X + Y and matrices with sorted rows and columns. Inform. Process. Lett. 20, 1 (1985), 13-17.
28. 28. Robson, J. M. Algorithms for maximum independent sets. J. Algorithms 7 (1986), 425-440.
29. 29. Robson, M. A distributed algorithm for generating X + Y in order. Research Report 91-19, LIP-ENS Lyon, 69364 Lyon Cedex 07, France, 1991.
30. n/4) algorithm for certain NP-complete problems. SIAM J. Comput. 3, 10 (1981), 456-464.
31. 31. Stearns, R. E., and Hunt III, H. B. Power indices and easier hard problems. Math. Systems. Theory 23, 4 (1990), 209-225.
32. 32. Tarjan, R. E., and Trojanowski, A. E. Finding a maximum independent set. SIAM J. Comput. 6 (1977), 537-546.