scientific article

zbMath1187.68248MaRDI QIDQ3181697

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

Publication date: 12 October 2009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

knapsack problemsstrong NP-completenesspseudo-polynomial algorithms

Mathematics Subject Classification ID

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

Related Items (10)

Subset sum problems with digraph constraints ⋮ Approximation schemes for subset-sums ratio problems ⋮ Approximating subset sum ratio via subset sum computations ⋮ Faster algorithms for \(k\)-\textsc{Subset Sum} and variations ⋮ Approximation schemes for parallel machine scheduling with availability constraints ⋮ Simple FPTAS for the subset-sums ratio problem ⋮ Some algorithmic results for [2-sumset covers] ⋮ Discrepancy one among homogeneous arithmetic progressions ⋮ Unnamed Item ⋮ Faster algorithms for \(k\)-subset sum and variations

This page was built for publication: