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...

Ausführliche Beschreibung