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 journalArticlepeer-review

51 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

Keywords

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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On positive influence dominating sets in social networks'. Together they form a unique fingerprint.

Cite this