The Incremental Knapsack Problem with Monotone Submodular All-or-Nothing Profits
Data Structures and Algorithms
2023-04-26 v1 Optimization and Control
Abstract
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.
Keywords
Cite
@article{arxiv.2304.12967,
title = {The Incremental Knapsack Problem with Monotone Submodular All-or-Nothing Profits},
author = {Federico D'Onofrio and Yuri Faenza and Lingyi Zhang},
journal= {arXiv preprint arXiv:2304.12967},
year = {2023}
}