no code implementations • 19 Nov 2019 • Wei Chen, Binghui Peng, Grant Schoenebeck, Biaoshuai Tao
On the other side, we prove that in any submodular cascade, the adaptive greedy algorithm always outputs a $(1-1/e)$-approximation to the expected number of adoptions in the optimal non-adaptive seed choice.
Social and Information Networks
