Login / Signup
On maximizing monotone or non-monotone k-submodular functions with the intersection of knapsack and matroid constraints.
Kemin Yu
Min Li
Yang Zhou
Qian Liu
Published in:
J. Comb. Optim. (2023)
Keyphrases
</>
submodular functions
greedy algorithm
facility location problem
energy function
combinatorial optimization
knapsack problem
objective function
convex optimization
diminishing returns
dynamic programming
facility location
upper bound
constraint satisfaction
approximation algorithms
theoretical guarantees
optimal solution
special case