1 citations · 1 across the 9 of their papers we have counts for
1 paper · 1 filter
Max Klimm, Marc E. Pfetsch, Rico Raber +1
We consider a general class of binary packing problems with a convex quadratic knapsack constraint. We prove that these problems are APX-hard to approximate and present constant-fa…