On positive influence dominating sets in social networks

Authors:
Feng Wang;Hongwei Du;Erika Camacho;Kuai Xu;Wonjun Lee;Yan Shi;Shan Shan
Affiliations:
Division of Mathematical and Natural Sciences, Arizona State University, Phoenix, AZ 85069, USA;Department of Computer Science, Illinois Institute of Technology, Chicago, IL 60616, USA;Division of Mathematical and Natural Sciences, Arizona State University, Phoenix, AZ 85069, USA;Division of Mathematical and Natural Sciences, Arizona State University, Phoenix, AZ 85069, USA;Division of Computer and Communication Engineering, Korea University, Seoul, Republic of Korea;Department of Computer Science, University of Texas at Dallas, Richardson, TX 75080, USA;Department of Computer Science, University of Texas at Dallas, Richardson, TX 75080, USA
Venue:
Theoretical Computer Science
Year:
2011

Citing 6
Cited 4

Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs

SIAM Journal on Computing
Structural and algorithmic aspects of massive social networks

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Analysis of greedy approximations with nonsubmodular potential functions

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the hardness of optimization in power-law graphs

Theoretical Computer Science
Positive Influence Dominating Set in Online Social Networks

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Design and Analysis of Approximation Algorithms

Design and Analysis of Approximation Algorithms

Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs

FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
On the approximability and exact algorithms for vector domination and related problems in graphs

Discrete Applied Mathematics
A New Algorithm for Positive Influence Dominating Set in Social Networks

ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
A self-stabilizing algorithm for finding a minimal positive influence dominating set in social networks

ADC '13 Proceedings of the Twenty-Fourth Australasian Database Conference - Volume 137

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper, we investigate the positive influence dominating set (PIDS) which has applications in social networks. We prove that PIDS is APX-hard and propose a greedy algorithm with an approximation ratio of H(@d) where H is the harmonic function and @d is the maximum vertex degree of the graph representing a social network.