Streaming algorithms for Budgeted k-Submodular Maximization problem

09/18/2021
by   Canh V. Pham, et al.
VNU
0

Stimulated by practical applications arising from viral marketing. This paper investigates a novel Budgeted k-Submodular Maximization problem defined as follows: Given a finite set V, a budget B and a k-submodular function f: (k+1)^V ↦ℝ_+, the problem asks to find a solution =(S_1, S_2, …, S_k), each element e ∈ V has a cost c_i(e) to be put into i-th set S_i, with the total cost of s does not exceed B so that f() is maximized. To address this problem, we propose two streaming algorithms that provide approximation guarantees for the problem. In particular, in the case of each element e has the same cost for all i-th sets, we propose a deterministic streaming algorithm which provides an approximation ratio of 1/4-ϵ when f is monotone and 1/5-ϵ when f is non-monotone. For the general case, we propose a random streaming algorithm that provides an approximation ratio of min{α/2, (1-α)k/(1+β)k-β}-ϵ when f is monotone and min{α/2, (1-α)k/(1+2β)k-2β}-ϵ when f is non-monotone in expectation, where β=max_e∈ V, i , j ∈ [k], i≠ jc_i(e)/c_j(e) and ϵ, α are fixed inputs.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

12/18/2021

Streaming Based Bicriteria Approximation Algorithms for Submodular Optimization

This paper proposes the optimization problem Non-Monotone Submodular Cov...
02/20/2018

Do Less, Get More: Streaming Submodular Maximization with Subsampling

In this paper, we develop the first one-pass streaming algorithm for sub...
08/10/2021

A Parallel Algorithm for Minimum Cost Submodular Cover

In a minimum cost submodular cover problem (MinSMC), given a monotone no...
10/03/2018

Submodular Stochastic Probing with Prices

We introduce Stochastic Probing with Prices (SPP), a variant of the Stoc...
08/09/2018

Generalized budgeted submodular set function maximization

In this paper we consider a generalization of the well-known budgeted ma...
07/09/2019

Stochastic Monotone Submodular Maximization with Queries

We study a stochastic variant of monotone submodular maximization proble...
07/21/2018

Streaming Methods for Restricted Strongly Convex Functions with Applications to Prototype Selection

In this paper, we show that if the optimization function is restricted-s...
This week in AI

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