A Parallel O(n2:::7n/8:::) Time-Memory-Processor Tradeoff for Knapsack-Like Problems

Kenli Li, Renfa Li, Lei Yang, Yan-Tao Zhou. A Parallel O(n2:::7n/8:::) Time-Memory-Processor Tradeoff for Knapsack-Like Problems. In Hai Jin, Daniel A. Reed, Wenbin Jiang, editors, Network and Parallel Computing, IFIP International Conference, NPC 2005, Beijing, China, November 30 - December 3, 2005, Proceedings. Volume 3779 of Lecture Notes in Computer Science, pages 197-204, Springer, 2005. [doi]

@inproceedings{LiLLZ05,
  title = {A Parallel O(n2:::7n/8:::) Time-Memory-Processor Tradeoff for Knapsack-Like Problems},
  author = {Kenli Li and Renfa Li and Lei Yang and Yan-Tao Zhou},
  year = {2005},
  doi = {10.1007/11577188_26},
  url = {http://dx.doi.org/10.1007/11577188_26},
  researchr = {https://researchr.org/publication/LiLLZ05},
  cites = {0},
  citedby = {0},
  pages = {197-204},
  booktitle = {Network and Parallel Computing, IFIP International Conference, NPC 2005, Beijing, China, November 30 - December 3, 2005, Proceedings},
  editor = {Hai Jin and Daniel A. Reed and Wenbin Jiang},
  volume = {3779},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-29810-X},
}