Maximizing the minimum of $k$ submodular functions
Krause, McMahan, Guestrin and Gupta, who call this problem Robust Submodular Observation Selection show that is is NP-hard to approximate this problem to within any constant.