scientific article; zbMATH DE number 5026927

MaRDI QIDQ5469596zbMATH OpenFDO

Authors Jun Pan, KenLi Li, Q. H. Li

Publication date 26 May 2006

zbMATH Keywords

hardware-time tradeoffNP-hardparallel algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• An improved parallel algorithm for 0/1 knapsack problem
• A parallel two-list algorithm for the knapsack problem
• scientific article; zbMATH DE number 2075843
• A combined parallel algorithm for solving the knapsack problem
• A new algorithm for the integer knapsack problem and its parallelization
• Parallel Algorithms for Knapsack Type Problems
• Approximate algorithms for the Knapsack problem on parallel computers
• An efficient parallel algorithm for solving the knapsack problem on hypercubes

Cited in

(5)

• The two list algorithm for the knapsack problem on an FPS T20
• A parallel two-list algorithm for the knapsack problem
• Comments on parallel algorithms for the knapsack problem.
• A parallel time-memory-processor tradeoff \(O(2^{5n/6})\) for knapsack-like NP-complete problems
• scientific article; zbMATH DE number 2075843 (Why is no real title available?)

This page was built for publication:

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