Parallel approximation schemes for subset sum and knapsack problems

DOI10.1007/BF00292111zbMath0606.68037MaRDI QIDQ1084863

Larry Rudolph, Joseph G. Peters

Publication date: 1987

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

optimization problemsparallel algorithmsmaximum numbers of processorsparallel running times

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Combinatorial optimization (90C27)

Related Items

Parallel approximation schemes for subset sum and knapsack problems, Parallel approximation schemes for problems on planar graphs, Approximate algorithms for the Knapsack problem on parallel computers

Cites Work

• Parallel approximation schemes for subset sum and knapsack problems
• General approximation algorithms for some arithmetical combinatorial problems
• Algorithms for Scheduling Independent Tasks
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Combinatorial Problems: Reductibility and Approximation
• Parallelism in random access machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item