In the generalized budgeted submodular set function maximization problem, we are given a ground set of elements and a set of bins. Each bin has its own cost and the cost of each element depends on its associated bin. The goal is to find a subset of elements along with an associated set of bins such that the overall costs of both is at most a given budget, and the profit is maximized. We present an algorithm that guarantees a [Formula presented](1−[Formula presented])-approximation, where α≤1 is the approximation factor of an algorithm for a sub-problem. If the costs satisfy a specific condition, we provide a polynomial-time algorithm that gives us α=1−ϵ, while for the general case we design an algorithm with α=1−[Formula presented]−ϵ. We extend our results providing a bi-criterion approximation algorithm where we can spend an extra budget up to a factor β≥1 to guarantee a [Formula presented](1−[Formula presented])-approximation.
|Titolo:||Generalized budgeted submodular set function maximization|
|Data di pubblicazione:||2021|
|Appare nelle tipologie:||1.1 Articolo in rivista|