Generalized budgeted submodular set function maximization

08/09/2018
by   Francesco Cellinese, et al.
0

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. 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. Each bin has its own cost and the cost of each element depends on its associated bin. The profit is measured by a monotone submodular function over the elements. We first present an algorithm that guarantees an approximation factor of 1/2(1-1/e^α), where α≤ 1 is the approximation factor of an algorithm for a sub-problem. We give two polynomial-time algorithms to solve this sub-problem. The first one gives us α=1- ϵ if the costs satisfies a specific condition, which is fulfilled in several relevant cases, including the unitary costs case and the problem of maximizing a monotone submodular function under a knapsack constraint. The second one guarantees α=1-1/e-ϵ for the general case. The gap between our approximation guarantees and the known inapproximability bounds is 1/2. We extend our algorithm to a bi-criterion approximation algorithm in which we are allowed to spend an extra budget up to a factor β≥ 1 to guarantee a 1/2(1-1/e^αβ)-approximation. If we set β=1/α(1/2ϵ), the algorithm achieves an approximation factor of 1/2-ϵ, for any arbitrarily small ϵ>0.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

05/31/2021

On maximizing a monotone k-submodular function under a knapsack constraint

We study the problem of maximizing a monotone k-submodular function f un...
01/09/2020

Maximizing diversity over clustered data

Maximum diversity aims at selecting a diverse set of high-quality object...
09/18/2021

Streaming algorithms for Budgeted k-Submodular Maximization problem

Stimulated by practical applications arising from viral marketing. This ...
05/02/2019

Tight Approximation Bounds for Maximum Multi-Coverage

In the classic maximum coverage problem, we are given subsets T_1, ..., ...
03/31/2020

Robust Multiple-Path Orienteering Problem: Securing Against Adversarial Attacks

The multiple-path orienteering problem asks for paths for a team of robo...
07/20/2021

Deterministic Budget-Feasible Clock Auctions

We revisit the well-studied problem of budget-feasible procurement, wher...
05/02/2019

Budget-Feasible Mechanism Design for Non-Monotone Submodular Objectives: Offline and Online

The framework of budget-feasible mechanism design studies procurement au...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.