On minimizing budget and time in influence propagation over social networks
An analysis of the greedy algorithm for the submodular set covering problem