Approximate algorithms for the Knapsack problem on parallel computers
From MaRDI portal
Publication:757041
DOI10.1016/0890-5401(91)90063-8zbMath0723.68042MaRDI QIDQ757041
I. V. Ramakrishnan, P. S. Gopalakrishnan, Laveen N. Kanal
Publication date: 1991
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(91)90063-8
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Approximate algorithms for the Knapsack problem on parallel computers
- Parallel approximation schemes for subset sum and knapsack problems
- Parallel Merge Sort
- Fast Approximation Algorithms for Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Combinatorial Problems: Reductibility and Approximation