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.
Aug 9, 2018 · The profit is measured by a monotone submodular function over the elements. We first present an algorithm that guarantees an approximation ...
Aug 27, 2018 · In this paper we consider a generalization of the well-known budgeted maximum coverage problem. We are given a ground set of elements and a set ...
[PDF] Generalized Budgeted Submodular Set Function Maximization
dagstuhl.sunsite.rwth-aachen.de › pdf
The goal is to find a subset of elements along with an associated set of bins, such that the overall cost is at most a given budget, and the profit is maximized ...
A generalization of the well-known budgeted maximum coverage problem to find a subset of elements along with an associated set of bins, such that the ...
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 ...
Abstract. In this paper we consider a generalization of the well-known budgeted maximum coverage problem. We are given a ground set of elements and a set of ...
In this paper we consider a generalization of the well-known budgeted maximum coverage problem. We are given a ground set of elements and a set of bins.
In this paper we consider a generalization of the well-known budgeted maximum coverage problem. We are given a ground set of elements and a set of bins.
We presented an efficient approximation algorithm for the budgeted maximization of nondecreasing submodular set functions. We proved bounds on the absolute ...