Adversarially Robust Submodular Maximization under Knapsack Constraints.

Dmitrii Avdiukhin Slobodan Mitrovic Grigory Yaroslavtsev Samson Zhou

Published in: CoRR (2019)

Keyphrases

objective function
dynamic programming
knapsack problem
upper bound
linear constraints
case study
greedy algorithm
database
data sets
neural network
computer vision
optimal solution
geometric constraints