  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 harder to approximate than a less general class of
modular incremental knapsack problems, that have been investigated in the
literature. We also show that certain extensions to more general submodular
functions are APX-hard.
