On positive influence dominating sets in social networks

被引:62
|
作者
Wang, Feng [1 ]
Du, Hongwei [2 ]
Camacho, Erika [1 ]
Xu, Kuai [1 ]
Lee, Wonjun [3 ]
Shi, Yan [4 ]
Shan, Shan [4 ]
机构
[1] Arizona State Univ, Div Math & Nat Sci, Phoenix, AZ 85069 USA
[2] IIT, Dept Comp Sci, Chicago, IL 60616 USA
[3] Korea Univ, Div Comp & Commun Engn, Seoul, South Korea
[4] Univ Texas Dallas, Dept Comp Sci, Richardson, TX 75080 USA
关键词
Dominating set; Positive influence dominating set; Social networks; APX-hard;
D O I
10.1016/j.tcs.2009.10.001
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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(delta) where H is the harmonic function and delta is the maximum vertex degree of the graph representing a social network. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:265 / 269
页数:5
相关论文
共 50 条
  • [41] Net positive influence maximization in signed social networks
    Li, Dong
    Wang, Yuejiao
    Li, Muhao
    Sun, Xin
    Pan, Jingchang
    Ma, Jun
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2021, 41 (02) : 3821 - 3832
  • [42] A Positive Influence Maximization Algorithm in Signed Social Networks
    Zhu, Wenlong
    Huang, Yang
    Yang, Shuangshuang
    Miao, Yu
    Peng, Chongyuan
    CMC-COMPUTERS MATERIALS & CONTINUA, 2023, 76 (02): : 1977 - 1994
  • [43] Maximizing the spread of positive influence in signed social networks
    Hosseini-Pozveh, Maryam
    Zamanifar, Kamran
    Naghsh-Nilchi, Ahmad Reza
    Dolog, Peter
    INTELLIGENT DATA ANALYSIS, 2016, 20 (01) : 199 - 218
  • [44] Maximizing the Spread of Positive Influence in Online Social Networks
    Zhang, Huiyuan
    Dinh, Thang N.
    Thai, My T.
    2013 IEEE 33RD INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS), 2013, : 317 - 326
  • [45] Time-Bounded Positive Influence in Social Networks
    Shi, Tuo
    Wan, Jialin
    Cheng, Siyao
    Cai, Zhipeng
    Li, Yingshu
    Li, Jianzhong
    2015 INTERNATIONAL CONFERENCE ON IDENTIFICATION, INFORMATION, AND KNOWLEDGE IN THE INTERNET OF THINGS (IIKI), 2015, : 134 - 139
  • [46] Disjoint dominating and total dominating sets in graphs
    Henning, Michael A.
    Loewenstein, Christian
    Rautenbach, Dieter
    Southey, Justin
    DISCRETE APPLIED MATHEMATICS, 2010, 158 (15) : 1615 - 1623
  • [47] Reconfiguration of dominating sets
    Suzuki, Akira
    Mouawad, Amer E.
    Nishimura, Naomi
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 32 (04) : 1182 - 1195
  • [48] Dominating Sets and Independent Sets in a Tree
    Jou, Min-Jen
    ARS COMBINATORIA, 2010, 96 : 499 - 503
  • [49] On dominating sets and independent sets of graphs
    Harant, J
    Pruchnewski, A
    Voigt, M
    COMBINATORICS PROBABILITY & COMPUTING, 1999, 8 (06): : 547 - 553
  • [50] Dominating sets of centipedes
    Alikhani, Saeid
    Peng, Yee-Hock
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2009, 12 (04): : 411 - 428