On maximizing a monotone k-submodular function under a knapsack constraint.
Zhongzheng TangChenhao WangHau ChanPublished in: CoRR (2021)
Keyphrases
- submodular functions
- greedy algorithm
- facility location problem
- knapsack problem
- energy function
- dynamic programming
- combinatorial optimization
- objective function
- convex optimization
- worst case
- upper bound
- optimal solution
- theoretical guarantees
- facility location
- optimization problems
- graphical models
- learning tasks
- support vector machine
- lower bound