A Parallel Algorithm for the Knapsack Problem

DOI10.1109/TC.1984.1676456MaRDI QIDQ3309063zbMATH OpenFDO

Authors Ehud D. Karnin

Publication date 1984

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.1984.1676456

zbMATH Keywords

cryptographyknapsack problemparallel architecturetime-memory- processor tradeoffVLSI complexity

Mathematics Subject Classification ID

Theory of operating systems (68N25) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Cited in

(2)

• An efficient pruning algorithm for value independent knapsack problem using a DAG structure
• An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem

This page was built for publication: A Parallel Algorithm for the Knapsack Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3309063)