On positive influence dominating sets in social networks

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 ( δ ) where H is the harmonic function and δ is the maximum vertex degree of the graph...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 412; no. 3; pp. 265 - 269
Main Authors Wang, Feng, Du, Hongwei, Camacho, Erika, Xu, Kuai, Lee, Wonjun, Shi, Yan, Shan, Shan
Format Journal Article
LanguageEnglish
Published Oxford Elsevier B.V 21.01.2011
Elsevier
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Approximation
APX-hard
Computer science; control theory; systems
Dominating set
Exact sciences and technology
Graphs
Greedy algorithms
Harmonic functions
Mathematical analysis
Miscellaneous
Networks
Positive influence dominating set
Proportional integral derivative
Social networks
Theoretical computing
Social networks
APX-hard
Dominating set
Positive influence dominating set
Maximum
Computer theory
Greedy algorithm
Graph degree
Influence
Vertex(graph)
Approximation algorithm
Harmonic function
Online AccessGet full text

Cover

More Information
Summary: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 ( δ ) where H is the harmonic function and δ is the maximum vertex degree of the graph representing a social network.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2009.10.001