activity
20192023
most citedApproximation Algorithms for The Generalized Incremental Knapsack Problem

1 citations · 2 across the 5 of their papers we have counts for

collaborators
Showing 2023Show all

1 paper · 1 filter

cs.DS2023

The Incremental Knapsack Problem with Monotone Submodular All-or-Nothing Profits

Federico D'Onofrio, Yuri Faenza, Lingyi Zhang

We study incremental knapsack problems with profits given by a special class of monotone submodular functions, that we dub all-or-nothing. We show that these problems are not harde…