A hypercube algorithm for the 0/1 knapsack problem
Journal of Parallel and Distributed Computing
Adaptive parallel algorithms for integral knapsack problems
Journal of Parallel and Distributed Computing - Special issue: algorithms for hypercube computers
New complexity results on scheduling with small communication delays
Discrete Applied Mathematics - Special volume: Aridam VI and VII, Rutcor, New Brunswick, NJ, USA (1991 and 1992)
Optimal schedules for d-D grid graphs with communication delays
Parallel Computing
Computing Partitions with Applications to the Knapsack Problem
Journal of the ACM (JACM)
Parallel dynamic programming and automata theory
Parallel Computing - High performance computing in operations research
Knapsack on VLSI: from Algorithm to Optimal Circuit
IEEE Transactions on Parallel and Distributed Systems
An Efficient Parallel Algorithm for Solving the Knapsack Problem on the Hypercube
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Efficient Linear Systolic Array for the Knapsack Problem
CONPAR '92/ VAPP V Proceedings of the Second Joint International Conference on Vector and Parallel Processing: Parallel Processing
A Parallel Algorithm for the Knapsack Problem
IEEE Transactions on Computers
A simple version of Karzanov's blocking flow algorithm
Operations Research Letters
Parallel time and space upper-bounds for the subset-sum problem
Theoretical Computer Science
A note on developing optimal and scalable parallel two-list algorithms
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
An entropy-based neighbor selection approach for collaborative filtering
Knowledge-Based Systems
| Hi-index | 0.00 |
We present in this paper an efficient algorithm for solving the integral Knapsack problem on hypercube. The main idea is to represent the computations of the dynamic programming formulation as a precedence graph (which has the structure of an irregular mesh). Then, we propose a time optimal scheduling algorithm for computing the irregular meshes on hypercube.