Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Inclusion-wise extremal knapsack problems are (mostly) hard to approximate
Fabio Ciccarelli, Fabio Furini, Ulrich Pferschy +1
We study two inclusion-wise extremal variants of the 0-1 Knapsack Problem (KP). Given items with integer weights and nonnegative costs or profits, the Minimum-Cost Maximal Knap…
cs.DS2026
A tight 1/3-approximation algorithm and fully polynomial-time approximation schemes for the Colored Knapsack Problem
Fabio Ciccarelli, Fabio Furini
The (ColKP) generalizes the classical Knapsack Problem by partitioning the items into color classes and requiring the selected items to admit an…