Streaming algorithms for Budgeted $k$-Submodular Maximization problem
Canh V. Pham, Quang C. Vu, Dung K. T. Ha, and Tai T. Nguyen

TL;DR
This paper introduces streaming algorithms with approximation guarantees for the Budgeted $k$-Submodular Maximization problem, addressing practical applications like viral marketing with theoretical performance bounds.
Contribution
It proposes the first streaming algorithms with approximation ratios for the Budgeted $k$-Submodular Maximization problem, including both deterministic and randomized approaches.
Findings
Deterministic algorithm achieves 1/4-ε approximation for monotone functions.
Randomized algorithm attains a ratio depending on parameters α, β, and k.
Algorithms work for both monotone and non-monotone functions under budget constraints.
Abstract
Stimulated by practical applications arising from viral marketing. This paper investigates a novel Budgeted -Submodular Maximization problem defined as follows: Given a finite set , a budget and a -submodular function , the problem asks to find a solution , each element has a cost to be put into -th set , with the total cost of does not exceed so that 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 has the same cost for all -th sets, we propose a deterministic streaming algorithm which provides an approximation ratio of when is monotone and when is non-monotone. For the general case, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Optimization and Search Problems · Advanced Graph Theory Research
