On positive influence dominating sets in social networks

Feng Wang, Hongwei Du, Erika Camacho, Kuai Xu, Wonjun Lee, Yan Shi, Shan Shan

Research output: Contribution to journalArticle

42 Citations (Scopus)

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

Original languageEnglish
Pages (from-to)265-269
Number of pages5
JournalTheoretical Computer Science
Volume412
Issue number3
DOIs
Publication statusPublished - 2011 Jan 21

Fingerprint

Harmonic functions
Dominating Set
Social Networks
Vertex Degree
Greedy Algorithm
Harmonic Functions
Approximation
Graph in graph theory
Influence

Keywords

  • APX-hard
  • Dominating set
  • Positive influence dominating set
  • Social networks

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

On positive influence dominating sets in social networks. / Wang, Feng; Du, Hongwei; Camacho, Erika; Xu, Kuai; Lee, Wonjun; Shi, Yan; Shan, Shan.

In: Theoretical Computer Science, Vol. 412, No. 3, 21.01.2011, p. 265-269.

Research output: Contribution to journalArticle

Wang, F, Du, H, Camacho, E, Xu, K, Lee, W, Shi, Y & Shan, S 2011, 'On positive influence dominating sets in social networks', Theoretical Computer Science, vol. 412, no. 3, pp. 265-269. https://doi.org/10.1016/j.tcs.2009.10.001
Wang, Feng ; Du, Hongwei ; Camacho, Erika ; Xu, Kuai ; Lee, Wonjun ; Shi, Yan ; Shan, Shan. / On positive influence dominating sets in social networks. In: Theoretical Computer Science. 2011 ; Vol. 412, No. 3. pp. 265-269.
@article{4bcf708a43864f6b92f41b3e7f47ab10,
title = "On positive influence dominating sets in social networks",
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(δ) where H is the harmonic function and δ is the maximum vertex degree of the graph representing a social network.",
keywords = "APX-hard, Dominating set, Positive influence dominating set, Social networks",
author = "Feng Wang and Hongwei Du and Erika Camacho and Kuai Xu and Wonjun Lee and Yan Shi and Shan Shan",
year = "2011",
month = "1",
day = "21",
doi = "10.1016/j.tcs.2009.10.001",
language = "English",
volume = "412",
pages = "265--269",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - On positive influence dominating sets in social networks

AU - Wang, Feng

AU - Du, Hongwei

AU - Camacho, Erika

AU - Xu, Kuai

AU - Lee, Wonjun

AU - Shi, Yan

AU - Shan, Shan

PY - 2011/1/21

Y1 - 2011/1/21

N2 - 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.

AB - 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.

KW - APX-hard

KW - Dominating set

KW - Positive influence dominating set

KW - Social networks

UR - http://www.scopus.com/inward/record.url?scp=78650587288&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78650587288&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2009.10.001

DO - 10.1016/j.tcs.2009.10.001

M3 - Article

VL - 412

SP - 265

EP - 269

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 3

ER -