Robust Optimization for Submodular Minimization under Uncertainty

The core message of this paper is to provide a complete computational complexity map of the Robust Submodular Minimizer problem, which aims to find a set that is close to some optimal solution for each of the k given submodular functions, under a given recovery bound d.