K. Avrachenkov, P. Basu, G. Neglia, B. F. Ribeiro, and D. Towsley, Online myopic network covering, 1212.
DOI : 10.1109/infcomw.2014.6849335
URL : https://hal.archives-ouvertes.fr/hal-01092416

P. Domingos and M. Richardson, Mining the network value of customers, Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '01, pp.57-66, 2001.
DOI : 10.1145/502512.502525

M. Richardson and P. Domingos, Mining knowledge-sharing sites for viral marketing, Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '02, pp.61-70, 2002.
DOI : 10.1145/775047.775057

D. Kempe and J. Kleinberg, Maximizing the spread of influence through a social network, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '03, pp.137-146, 2003.
DOI : 10.1145/956750.956769

D. Kempe and J. Kleinberg, Influential Nodes in a Diffusion Model for Social Networks, ICALP: Annual International Colloquium on Automata, Languages and Programming, 2005.
DOI : 10.1007/11523468_91

R. Mossel, On the submodularity of influence in social networks, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , STOC '07, 2007.
DOI : 10.1145/1250790.1250811

G. Nemhauser, L. Wolsey, and M. Fisher, An analysis of approximations for maximizing submodular set functions???I, Mathematical Programming, pp.265-294, 1978.
DOI : 10.1007/BF01588971

S. Guha and S. Khuller, Approximation algorithms for connected dominating sets, Algorithmica, vol.20, 1996.