On the complexity of variations of equal sum subsets

MaRDI QIDQ3181697zbMATH OpenFDO

Authors Mark Cieliebak, Aris Pagourtzis, Konrad Schlude, Stephan J. Eidenbenz

Publication date 12 October 2009

zbMATH Keywords

knapsack problemspseudo-polynomial algorithmsstrong NP-completeness

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• On the equal-subset-sum problem
• Faster algorithms for \(k\)-subset sum and variations
• Efficient approximation algorithms for the subset-sums equality problem.
• scientific article; zbMATH DE number 1223719
• On strong NP-completeness of rational problems

Cited in

(18)

• On the equal-subset-sum problem
• On variations of the subset sum problem
• Efficient approximation algorithms for the subset-sums equality problem.
• Subset sum problems with digraph constraints
• Faster algorithms for \(k\)-subset sum and variations
• Approximation schemes for subset-sums ratio problems
• Approximating subset sum ratio via subset sum computations
• On the hardness of finding subsets with equal average
• Simple FPTAS for the subset-sums ratio problem
• scientific article; zbMATH DE number 1223719 (Why is no real title available?)
• Some algorithmic results for [2]-sumset covers
• Discrepancy one among homogeneous arithmetic progressions
• Equal-subset-sum faster than the meet-in-the-middle
• Composing equipotent teams.
• Faster algorithms for \(k\)-\textsc{Subset Sum} and variations
• Approximation schemes for parallel machine scheduling with availability constraints
• Approximating subset sum ratio via partition computations
• Draw procedures for balanced 3-team group rounds in sports competitions

This page was built for publication: On the complexity of variations of equal sum subsets

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