Abstract
Influence problem is one of the central problems in the study of online social networks, the goal of which is to influence all nodes with the minimum number of seeds. However, in the real world, it might be too expensive to influence all nodes. In many cases, it is satisfactory to influence nodes only up to some percent p. In this paper, we study the minimum partial positive influence dominating set (MPPIDS) problem. In fact, we presented an approximation algorithm for a more general problem called minimum partial set multicover problem. As a consequence, the MPPIDS problem admits an approximation with performance ratio \(\gamma H(\Delta )\), where \(H(\cdot )\) is the Harmonic number, \(\gamma =1/(1-(1-p)\eta ),\eta \approx \Delta ^2/\delta \), and \(\Delta ,\delta \) are the maximum degree and the minimum degree of the graph, respectively. For power-law graphs, we show that our algorithm has a constant performance ratio.
Similar content being viewed by others
References
Aiello W, Chung F, Lu L (2001) A random graph model for powerlaw graphs. Exp Math 10:53–56
Albert R, Jeong H, Barabasi A (2000) Error and attack tolerance of complex networks. Nature 406:378–382
Clauset A, Shalizi C, Newman M (2009) Power-law distributions in empirical data. SIAM Rev 51:661–703
Cohen JN (2012) Professional resource: the potential of Google+ as a media literacy tool. J Media Lit Educ 4:93–96
Dinh TN, Shen Y, Nguyen DT, Thai MT (2014) On the approximability of positive influence dominating set in social networks. J Comb Optim 27:487–503
Dobson G (1982) Worst-case analysis of greedy heuristics for integer programming with non-negative data. Math Oper Res 7(4):515–531
Fisher ML, Wolsey LA (1982) On the greedy heuristic for continuous covering and packing problems. SIAM J Algebraic Discret Methods 3:584–591
Kleinberg J (2000) The small-world phenomenon: an algorithmic perspective. In: 32nd STOC, pp 163-170
Kolliopoulos SG (2003) Approximating covering integer programs with multiplicity constraints. Discrete Appl Math 129:461–473
Kolliopoulos SG, Young Neal E (2005) Approximation algorithms for covering/packing. J Comput Syst Sci 71:495–505
Raei H, Yazdani N, Asadpour M (2012) A new algorithm for positive influence dominating set in social networks. In: IEEE/ACM International conference on advances in social networks analysis and mining, pp 253–257
Rajagopalan S, Vazirani VV (1993) Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs. In: Proceedings of the 34th annual IEEE symposium on foundations of computer science, pp 322–331
Rawitz D, Shahar SH (2011) Partial multicovering and the d-consecutive ones property. Discret Optim 4:555–567
Srinivasan A (1996) An extension of the Lovász local lemma and its applications to integer programming. In: Proceedings of the seventh ACM-SIAM symposium on discrete algorithms, pp 6–15
Srinivasan A (1999) Improved approximations guarantees for packing and covering integer programs. SIAM J Comput 29:648–670 (preliminary version in Proc. STOC 95)
Srinivasan A, Teo C-P (2001) A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria. SIAM J Comput 30:2051–2068 (preliminary version in Proc. STOC 97)
Vazirani VV (2001) Approximation algorithms. Springer, Berlin
Wang F, Camacho E, Xu K (2009) Positive influence dominating set in online social networks. COCOA2009., LNCSSpringer, Berlin, pp 313–321
Wang F, Du H, Camacho E, Xu K, Lee W, Shi Y, Shan S (2011) On positive influence dominating sets in social networks. Theor Comput Sci 412:265–269
Zhang W, Wu W, Wang F, Xu K (2012a) Positive influence dominating sets in power-law graphs. Soc Netw Anal Min 2:31–37
Zhang W, Zhang Z, Wang W, Zou F, Lee W (2012b) Polynomial time approximation scheme for \(t\)-latency bounded information propagation problem in wireless networks. J Combin Optim 23:451–461
Zou F, Willson JK, Zhang Z, Wu W (2010) Fast Information propagation in social networks. Discret Math Algorithms Appl 2(1):125–141
Acknowledgments
This research is supported by NSFC (11531011, 61370216) and Xinjiang Talent Youth Project (2013711011).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ran, Y., Zhang, Z., Du, H. et al. Approximation algorithm for partial positive influence problem in social network. J Comb Optim 33, 791–802 (2017). https://doi.org/10.1007/s10878-016-0005-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-016-0005-0