On positive influence dominating sets in social networks

Theoretical Computer Science

Volumn 412, Issue 3, 2011, Pages 265-269

  Wang, Feng ^a   Du, Hongwei ^b   Camacho, Erika ^a   Xu, Kuai ^a   Lee, Wonjun ^c   Shi, Yan ^d   Shan, Shan ^d  

^a ARIZONA STATE UNIVERSITY   (United States)

^b Illinois Institute of Technology   (United States)

^c Korea University   (South Korea)

^d The University of Texas at Dallas   (United States)

Author keywords

APX hard; Dominating set; Positive influence dominating set; Social networks

Indexed keywords

APPROXIMATION RATIOS; APX-HARD; DOMINATING SETS; GREEDY ALGORITHMS; HARMONIC FUNCTION; SOCIAL NETWORKS; VERTEX DEGREE;

APPROXIMATION ALGORITHMS; HARMONIC ANALYSIS; HARMONIC FUNCTIONS;

SOCIAL NETWORKING (ONLINE);

EID: 78650587288     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.10.001     Document Type: Conference Paper

References (13)

1. Jeremy Blum, Min Ding, Andrew Thaeler, and Xiuzhen Cheng Connected dominating set in sensor networks and MANETs D.-Z. Du, P. Pardalos, Handbook of Combinatorial Optimization 2004 329 369
2. D.-Z. Du, Ker-I Ko, X.-D. Hu, Design and analysis of approximation algorithms, manuscript
3. Ding-Zhu Du, R.L. Graham, P.M. Pardalos, P.-J. Wan, W. Wu, W. Zhao, Analysis of greedy approximations with nonsubmodular potential functions, in: Proceedings of the 19th Annual ACMSIAM Symposium on Dicrete Algorithms, SODA, 2008, pp. 167175
4. D.-Z. Du, and Ker-I Ko Theory of Computational Complexity 2000 John Wiley
5. Eubank Stephen, Kumar V.S. Anil, Madhav V. Marathe, Srinivasan Aravind, Wang Nan, Structural and algorithmic aspects of massive social networks, in: Proceedings of the 15th Annual ACMSIAM symposium on Discrete Algorithms, SODA, 2004, pp. 718727
6. Alessandro Ferrante, Gopal Pandurangan, and Kihong Park On the hardness of optimization in power-law graphs Theoretical Computer Science 393 2008 220 230
7. X. Gao, Y. Wang, X. Li, and W. Wu Analysis on theoretical bonds for approximating dominating set problems Discrete Mathematics, Algorithms and Applications 1 1 2009 71 84
8. D. Li, L. Liu, and H. Yang Minimum connected r-hop k-dominating set in wireless networks Discrete Mathematics, Algorithms and Applications 1 1 2009 45 57
9. Feng Wang, Erika Camacho, and Kuai Xu Positive influence dominating set in online social networks Lecture Notes in Computer Science 5573 2009 313 321
10. W. Wang, D. Kim, N. Sohaee, C. Ma, and W. Wu A PTAS for minimum d-hop underwater sink placement problem in 2-D underwater sensor networks Discrete Mathematics, Algorithms and Applications 1 2 2009 283 289
11. W. Wang, D. Kim, J. Willson, B. Thuraisingham, and W. Wu A better approximation for minimum average routing path clustering problem in 2-D underwater sensor networks Discrete Mathematics, Algorithms and Applications 1 2 2009 175 191
12. L.A. Wolsey An analysis of the greedy algorithm for the submodular set covering problem Combinatorica 4 2 1982 385 393
13. Sridhar Rajagopalan, and Vijay V. Vazirani Primal-dual RNC approximation algorithms for set cover and covering integer program SIAM Journal on Computing 28 2 1999 525 540