Maximizing k-submodular functions under budget constraint: applications and streaming algorithms

Motivated by the practical applications in solving plenty of important combinatorial optimization problems, this paper investigates the 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 ↦ R + , the problem a...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of combinatorial optimization Vol. 44; no. 1; pp. 723 - 751
Main Authors:	Pham, Canh V., Vu, Quang C., Ha, Dung K. T., Nguyen, Tai T., Le, Nguyen D.
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.08.2022 Springer Nature B.V
Subjects:	Algorithms Budgets Combinatorial analysis Combinatorics Convex and Discrete Geometry Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Maximization Operations Research/Decision Theory Optimization Theory of Computation Streaming algorithm submodular Approximation algorithm Budget constraint
ISSN:	1382-6905, 1573-2886
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!