For optimization problems in social networks, many fall into submodular set function maximization subject to a cardinality constraint [1]}, [2]}, [3]}, [4]}. The budget allocation problem [5]} falls into monotone submodular function maximization over integer lattice subject to a knapsack constraint.
