Abstract
In social networks, there is a tendency for connected users to match each other’s behaviors. Moreover, a user likely adopts a behavior, if a certain fraction of his family and friends follows that behavior. Identifying people who have the most influential effect to the others is of great advantages, especially in politics, marketing, behavior correction, and so on. Under a graph-theoretical framework, we study the positive influence dominating set (PIDS) problem that seeks for a minimal set of nodes \(\mathcal{P}\) such that all other nodes in the network have at least a fraction ρ>0 of their neighbors in \(\mathcal{P}\). We also study a different formulation, called total positive influence dominating set (TPIDS), in which even nodes in \(\mathcal{P}\) are required to have a fraction ρ of neighbors inside \(\mathcal{P}\). We show that neither of these problems can be approximated within a factor of (1−ϵ)lnmax{Δ,|V|1/2}, where Δ is the maximum degree. Moreover, we provide a simple proof that both problems can be approximated within a factor lnΔ+O(1). In power-law networks, where the degree sequence follows a power-law distribution, both problems admit constant factor approximation algorithms. Finally, we present a linear-time exact algorithms for trees.
Similar content being viewed by others
Notes
The larger the constant c, the better the inapproximability result.
References
Aiello W, Chung F, Lu L (2000) A random graph model for massive graphs. In: STOC ’00. ACM, New York, pp 171–180. http://doi.acm.org/10.1145/335305.335326
Chlebík M, Chlebíková J (2004) Approximation hardness of dominating set problems. In: ESA’04, pp. 192–203
Cicalese F, Milanič M, Vaccaro U (2011) Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs. In: Proceedings of the 18th international conference on fundamentals of computation theory, FCT’11. Springer, Berlin, pp 288–297. http://dl.acm.org/citation.cfm?id=2034214.2034239
Dinh TN, Dung NT, Thai MT (2012) Cheap, easy, and massively effective viral marketing in social networks: truth or fiction? In: Proceedings of the 23rd ACM conference on hypertext and social media, HT ’12. ACM, Milwaukee
Domingos P, Richardson M (2001) Mining the network value of customers. In: KDD ’01. ACM, New York, pp 57–66. http://doi.acm.org/10.1145/502512.502525
Feige U (1998) A threshold of ln n for approximating set cover. J ACM 45(4):634–652. http://doi.acm.org/10.1145/285055.285059
Ferrante A, Pandurangan G, Park K (2008) On the hardness of optimization in power-law graphs. Theor Comput Sci 393(1–3):220–230. http://dx.doi.org/10.1016/j.tcs.2007.12.007
Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci USA 99(12):7821–7826. doi:10.1073/pnas.122653799. http://dx.doi.org/10.1073/pnas.122653799
Gkantsidis C, Mihail M, Saberi A (2003) Conductance and congestion in power law graphs. In: SIGMETRICS ’03. ACM, New York, pp 148–159. http://doi.acm.org/10.1145/781027.781046
Hill KG, Hawkins JD, Catalano RF, Abbott RD, Guo J (2005) Family influences on the risk of daily smoking initiation. J Adolescent Health 37(3):202–210. http://www.sciencedirect.com/science/article/B6T80-4GWPPTF-5/2/3548286c9c2228ce3c7afaa4db17830c
Kempe D, Kleinberg J, Tardos É. (2003) Maximizing the spread of influence through a social network. In: KDD’03. ACM, New York, pp 137–146
Kempe D, Kleinberg J, Tardos É (2005) Influential nodes in a diffusion model for social networks. In: ICALP’05. pp 1127–1138
Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: KDD ’07. ACM, New York, pp 420–429. http://doi.acm.org/10.1145/1281192.1281239
Rajagopalan S, Vazirani VV (1993) Primal-dual rnc approximation algorithms for (multi)-set (multi)-cover and covering integer programs. In: STOC ’93. IEEE Comput Soc, Washington, pp 322–331. http://dx.doi.org/10.1109/SFCS.1993.366855
Shakarian P, Paulo D (2012) Large social networks can be targeted for viral marketing with small seed sets. In: IEEE/ACM international conference on advances in social networks analysis and mining (ASONAM)
Standridge JB, Zylstra RG, Adams SM (2004) Alcohol consumption: an overview of benefits and risks. Southern Med J. http://journals.lww.com/smajournalonline/Fulltext/2004/07000/Alcohol_Consumption__An_Overview_of_Benefits_and.12.aspx
Trevisan L (2001) Non-approximability results for optimization problems on bounded degree instances. In: ACM symposium on theory of computing ’01. ACM, New York, pp 453–461. http://doi.acm.org/10.1145/380752.380839
Wang F, Camacho E, Xu K (2009) Positive influence dominating set in online social networks. In: COCOA ’09. Springer, Berlin, pp 313–321. http://dx.doi.org/10.1007/978-3-642-02026-1_29.
Zou F, Zhang Z, Wu W (2009) Latency-bounded minimum influential node selection in social networks. In: Liu B, Bestavros A, Du DZ, Wang J (eds) WASA. Lecture notes in computer science, pp 519–526. http://dx.doi.org/10.1007/978-3-642-03417-6_51
Zhang W, Zhang Z, Wang W, Zou F, Lee W (2010) Polynomial time approximation scheme for t-latency bounded information propagation problem in wireless networks. Journal of Combinatorial Optimization, 1–11. http://dx.doi.org/10.1007/s10878-010-9359-x
Zhu X, Yu J, Lee W, Kim D, Shan S, Du DZ (2010) New dominating sets in social networks. J Glob Optim 48:633–642. http://dx.doi.org/10.1007/s10898-009-9511-2
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Dinh, T.N., Shen, Y., Nguyen, D.T. et al. On the approximability of positive influence dominating set in social networks. J Comb Optim 27, 487–503 (2014). https://doi.org/10.1007/s10878-012-9530-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-012-9530-7