Efficient Approximation Algorithms for Several Positive Influence Dominating Set Problems in Social Networks

Identifying positive influence dominating set (PIDS) with the smallest cardinality can produce positive effect with the minimal cost on a social network. The purpose of this article is to propose new approximation algorithms for the minimum PIDS problem and its variants such as the minimum connected...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computational social systems Vol. 12; no. 5; pp. 2930 - 2939
Main Authors: Zhong, Hao, Li, Weisheng, Zhang, Qi, Lin, Ronghua, Tang, Yong
Format: Journal Article
Language:English
Published: Piscataway IEEE 01.10.2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
ISSN:2329-924X, 2373-7476
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Identifying positive influence dominating set (PIDS) with the smallest cardinality can produce positive effect with the minimal cost on a social network. The purpose of this article is to propose new approximation algorithms for the minimum PIDS problem and its variants such as the minimum connected PIDS and the minimum PIDS of multiplex networks, with the aim of finding target sets with smaller cardinality. Through the design of novel submodular potential function, we theoretically prove that new approximation algorithms yield approximation ratios with same order compared with existing algorithms. We further demonstrate the performance of our algorithm by showcasing its efficacy on several real-world and publicly available instances of social networks, thereby providing additional evidence that our proposed algorithm can identify PIDS with smaller cardinality.
AbstractList Identifying positive influence dominating set (PIDS) with the smallest cardinality can produce positive effect with the minimal cost on a social network. The purpose of this article is to propose new approximation algorithms for the minimum PIDS problem and its variants such as the minimum connected PIDS and the minimum PIDS of multiplex networks, with the aim of finding target sets with smaller cardinality. Through the design of novel submodular potential function, we theoretically prove that new approximation algorithms yield approximation ratios with same order compared with existing algorithms. We further demonstrate the performance of our algorithm by showcasing its efficacy on several real-world and publicly available instances of social networks, thereby providing additional evidence that our proposed algorithm can identify PIDS with smaller cardinality.
Author Lin, Ronghua
Zhang, Qi
Li, Weisheng
Zhong, Hao
Tang, Yong
Author_xml – sequence: 1
  givenname: Hao
  orcidid: 0000-0001-8960-5521
  surname: Zhong
  fullname: Zhong, Hao
  email: hzhong@m.scnu.edu.cn
  organization: School of Computer Science, South China Normal University, Guangzhou, Guangdong, China
– sequence: 2
  givenname: Weisheng
  orcidid: 0009-0009-9760-8541
  surname: Li
  fullname: Li, Weisheng
  email: liws@m.scnu.edu.cn
  organization: School of Computer Science, South China Normal University, Guangzhou, Guangdong, China
– sequence: 3
  givenname: Qi
  orcidid: 0009-0008-3611-2975
  surname: Zhang
  fullname: Zhang, Qi
  email: qzhang@gcc.edu.cn
  organization: School of Information Technology and Engineering, Guangzhou College of Commerce, Guangzhou, Guangdong, China
– sequence: 4
  givenname: Ronghua
  orcidid: 0000-0002-8003-570X
  surname: Lin
  fullname: Lin, Ronghua
  email: rhlin@m.scnu.edu.cn
  organization: School of Computer Science, South China Normal University, Guangzhou, Guangdong, China
– sequence: 5
  givenname: Yong
  orcidid: 0000-0002-9812-0742
  surname: Tang
  fullname: Tang, Yong
  email: ytang@m.scnu.edu.cn
  organization: School of Computer Science, South China Normal University, Guangzhou, Guangdong, China
BookMark eNpNkMtOwzAQRS1UJMrjA5BYWGKdMn4kTpZVeVVCgNQisYsSdwwuqV3slMff46pdsJpZ3DOje47JwHmHhJwzGDEG1dV8MpuNOPB8JHLJuIADMuRCiUxJVQy2O6-yisvXI3IW4xIAGM9zxWFIuhtjrLboejper4P_saumt97Rcffmg-3fV5EaH-gMvzA0HX320fb2C-nUmW6DTiO99ivrEuTeUqqnz8G3HSbMOjrz2iboEftvHz7iKTk0TRfxbD9PyMvtzXxynz083U0n44dMc1n0WdNqAAGQC9mIhkGjCmVwkXNVIBNlqzVKY5gRGlDydsF0uajaEmWhdAMlihNyububCn1uMPb10m-CSy9rwfNSMSikSCm2S-ngYwxo6nVI7cNvzaDeeq23Xuut13rvNTEXO8Yi4r98WRVKVeIPvMV3sA
CODEN ITCSGL
Cites_doi 10.1007/s10489-017-0987-z
10.1109/TSMC.2020.2987163
10.1109/INFCOMW.2019.8845129
10.1007/s10878-021-00812-3
10.1007/s44196-022-00098-1
10.1287/ijoc.2021.1144
10.1145/3340531.3411866
10.1016/j.cor.2023.106197
10.1093/comnet/cnab014
10.1007/978-3-642-25813-8_9
10.1007/s10878-022-00874-x
10.1103/PhysRevE.71.056103
10.1145/3626772.3657718
10.1016/j.dam.2020.08.010
10.1016/j.tcs.2009.10.001
10.1038/srep27823
10.1007/978-3-319-72150-7_25
10.1007/978-3-030-32456-8_55
10.1016/j.physa.2018.02.119
10.1145/3341161.3342890
10.1007/BF02579435
10.1016/j.tcs.2004.08.013
10.1038/s41598-017-17135-1
10.1109/TCSS.2021.3096247
10.1016/j.ins.2011.12.027
10.1016/j.tcs.2023.114069
10.1007/s11590-020-01628-6
10.1109/TCSS.2019.2937396
10.1109/CSE.2014.288
10.4086/toc.2015.v011a004
10.1103/PhysRevLett.115.218702
10.1080/15427951.2013.865686
10.1109/INFCOMW.2018.8406851
10.1007/978-3-642-02026-1_29
10.1109/ASONAM.2012.51
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2025
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2025
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1109/TCSS.2025.3541230
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts

Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Social Sciences (General)
EISSN 2373-7476
EndPage 2939
ExternalDocumentID 10_1109_TCSS_2025_3541230
10896779
Genre orig-research
GrantInformation_xml – fundername: Collaborative Innovation Center for Intelligent Educational Technology of Guangzhou
  grantid: 2023B04J0002
– fundername: National Key Research and Development Program of China (Research and Demonstration Application of Key Technologies for Personalized Learning Driven by Educational Big Data)
  grantid: 2023YFC3341200
– fundername: National Natural Science Foundation of China
  grantid: 62377015
  funderid: 10.13039/501100001809
– fundername: Research Cultivation Fund for The Youth Teachers of South China Normal University
  grantid: 23KJ29
– fundername: National Natural Science Foundation of China
  grantid: 62407016
  funderid: 10.13039/501100001809
– fundername: Tertiary Education Scientific research project of Guangzhou Municipal Education Bureau
  grantid: 2024312300
GroupedDBID 0R~
4.4
6IK
97E
AAJGR
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
AGQYO
AGSQL
AHBIQ
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
EBS
EJD
IFIPE
IPLJI
JAVBF
M43
OCL
PQQKQ
RIA
RIE
AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c246t-abc00300534a3a10a767fed5276e138bcce4ff1f3c0e42bd1c8d9b8e467ca08e3
IEDL.DBID RIE
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001470459100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2329-924X
IngestDate Mon Oct 13 00:03:56 EDT 2025
Sat Nov 29 07:22:06 EST 2025
Wed Oct 15 14:20:28 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 5
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c246t-abc00300534a3a10a767fed5276e138bcce4ff1f3c0e42bd1c8d9b8e467ca08e3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0009-0008-3611-2975
0000-0002-8003-570X
0009-0009-9760-8541
0000-0002-9812-0742
0000-0001-8960-5521
PQID 3258710643
PQPubID 2040411
PageCount 10
ParticipantIDs proquest_journals_3258710643
ieee_primary_10896779
crossref_primary_10_1109_TCSS_2025_3541230
PublicationCentury 2000
PublicationDate 2025-10-01
PublicationDateYYYYMMDD 2025-10-01
PublicationDate_xml – month: 10
  year: 2025
  text: 2025-10-01
  day: 01
PublicationDecade 2020
PublicationPlace Piscataway
PublicationPlace_xml – name: Piscataway
PublicationTitle IEEE transactions on computational social systems
PublicationTitleAbbrev TCSS
PublicationYear 2025
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref35
ref34
ref15
ref37
ref14
ref36
Zhang (ref31) 2022; 162
ref11
ref33
ref10
ref32
ref2
ref1
ref17
ref39
ref16
ref38
ref19
ref18
ref24
ref23
ref25
ref20
ref22
ref21
Wang (ref12) 2013; 137
ref28
ref27
McAuley (ref26) 2012
ref29
ref8
ref7
ref9
ref4
ref3
ref6
ref5
Rozemberczki (ref30) 2021
References_xml – ident: ref13
  doi: 10.1007/s10489-017-0987-z
– ident: ref6
  doi: 10.1109/TSMC.2020.2987163
– ident: ref19
  doi: 10.1109/INFCOMW.2019.8845129
– volume: 137
  start-page: 93
  volume-title: Proc. 24th Australas. Database Conf.
  year: 2013
  ident: ref12
  article-title: A self-stabilizing algorithm for finding a minimal positive influence dominating set in social networks
– ident: ref22
  doi: 10.1007/s10878-021-00812-3
– ident: ref16
  doi: 10.1007/s44196-022-00098-1
– ident: ref3
  doi: 10.1287/ijoc.2021.1144
– ident: ref29
  doi: 10.1145/3340531.3411866
– ident: ref17
  doi: 10.1016/j.cor.2023.106197
– ident: ref28
  doi: 10.1093/comnet/cnab014
– ident: ref4
  doi: 10.1007/978-3-642-25813-8_9
– ident: ref25
  doi: 10.1007/s10878-022-00874-x
– ident: ref37
  doi: 10.1103/PhysRevE.71.056103
– ident: ref1
  doi: 10.1145/3626772.3657718
– ident: ref11
  doi: 10.1016/j.dam.2020.08.010
– ident: ref10
  doi: 10.1016/j.tcs.2009.10.001
– ident: ref38
  doi: 10.1038/srep27823
– ident: ref35
  doi: 10.1007/978-3-319-72150-7_25
– ident: ref15
  doi: 10.1007/978-3-030-32456-8_55
– ident: ref14
  doi: 10.1016/j.physa.2018.02.119
– ident: ref27
  doi: 10.1145/3341161.3342890
– ident: ref9
  doi: 10.1007/BF02579435
– ident: ref24
  doi: 10.1016/j.tcs.2004.08.013
– ident: ref32
  doi: 10.1038/s41598-017-17135-1
– ident: ref20
  doi: 10.1109/TCSS.2021.3096247
– ident: ref39
  doi: 10.1016/j.ins.2011.12.027
– ident: ref7
  doi: 10.1016/j.tcs.2023.114069
– ident: ref23
  doi: 10.1007/s11590-020-01628-6
– ident: ref5
  doi: 10.1109/TCSS.2019.2937396
– ident: ref8
  doi: 10.1109/CSE.2014.288
– start-page: 548
  volume-title: Proc. 26th Annu. Conf. Neural Inf. Process. Syst., Lake Tahoe
  year: 2012
  ident: ref26
  article-title: Learning to discover social circles in ego networks
– ident: ref34
  doi: 10.4086/toc.2015.v011a004
– ident: ref33
  doi: 10.1103/PhysRevLett.115.218702
– ident: ref36
  doi: 10.1080/15427951.2013.865686
– ident: ref18
  doi: 10.1109/INFCOMW.2018.8406851
– ident: ref2
  doi: 10.1007/978-3-642-02026-1_29
– ident: ref21
  doi: 10.1109/ASONAM.2012.51
– year: 2021
  ident: ref30
  article-title: Twitch gamers: a dataset for evaluating proximity preserving and structural role-based node embeddings
– volume: 162
  start-page: 26265
  volume-title: Proc. Int. Conf. Mach. Learn.
  year: 2022
  ident: ref31
  article-title: Role-based multiplex network embedding
SSID ssj0001255720
Score 2.3229768
Snippet Identifying positive influence dominating set (PIDS) with the smallest cardinality can produce positive effect with the minimal cost on a social network. The...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Index Database
Publisher
StartPage 2930
SubjectTerms Algorithms
Approximation
Approximation algorithm
Approximation algorithms
connected positive influence dominating set (CPIDS)
Costs
Drugs
Electronic mail
Heuristic algorithms
Multiplexing
positive influence dominating set (PIDS)
Social networking (online)
Social networks
submodular function
Technological innovation
Time complexity
Training
Title Efficient Approximation Algorithms for Several Positive Influence Dominating Set Problems in Social Networks
URI https://ieeexplore.ieee.org/document/10896779
https://www.proquest.com/docview/3258710643
Volume 12
WOSCitedRecordID wos001470459100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 2373-7476
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001255720
  issn: 2329-924X
  databaseCode: RIE
  dateStart: 20140101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3NT8IwFG-EePDiJ0YUTQ8e1GS4rmu7HglC9EJIwITbsnVvSoLDsEH88-3HSDDGg7cd2m7p2-99tL_3HkK3VLusXDv6Xki58kKZG8wF0lPG3goWpCTMbLMJMRpFs5kc18nqNhcGACz5DLrm0d7lZ0u1NkdlGuGR5ELIBmoIwV2y1s6BCmMi2N5cEl8-TvuTiY4AA9alLNQa2v9he2wzlV8a2JqV4dE_P-gYHdb-I-45gZ-gPShOUdsl2eIaqCW-q6tJ35-hxcAWidDr4J6pH_41d8mKuLd4W67m1ftHibXjiiewMTPw2LK4NoBftu1L8NPS8GUMP1qPqvDY9aAp8bzA9YtHjkxettDrcDDtP3t1iwVPBSGvvCRVBuYaiWFCE-IngoscMhYIDoRGqVIQ5jnJqfIhDNKMqCiTaQRavarEj4Ceo2axLOACYW4iR0ayVKVcKwaS6EAlzwTLCaQJldBGD9vNjz9dJY3YRiC-jI2kYiOpuJZUG7XMbu8MdBvdRp2tvOIabGVMA6bDPuNbXf4x7QodmNUdCa-DmtVqDddoX22qebm6sf_RN6InyBg
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT-MwEB6xLBJc9gmiLA8fOOyuFIhfcXysClXRQlWpReotSpwJVIIWNaHi568fqcQKcdhbDnYcefLNw_5mBuCUW5c1sY5-JHhiIqErhzmmI-PsrZKsoKL0zSbUcJhOp3rUJqv7XBhE9OQzPHOP_i6_XJhnd1RmEZ7qRCn9AT5KIVgc0rVeHalIqdj67pLG-nzSG49tDMjkGZfC6uj4H-vj26m80cHesPQ__-cnfYFPrQdJukHkX2ED59-gE9JsSQvVmvxs60n_-g4Pl75MhH0P6boK4i-zkK5Iug93i-WsuX-siXVdyRhXbgYZeR7XCsnVuoEJuVg4xoxjSNtRDRmFLjQ1mc1Ju_Aw0MnrXbjtX056g6htshAZJpImygvjgG6xKHKe0zhXiaqwlEwlSHlaGIOiqmjFTYyCFSU1aamLFK2CNXmcIt-DzflijvtAEhc7SloWpkisaqC5DVWqUsmKYpFzjR34vd787CnU0sh8DBLrzEkqc5LKWkl1YNft9quBYaM7cLiWV9bCrc44kzbwc97VwTvTTmB7MLm5zq6vhn9-wI5bKVDyDmGzWT7jEWyZVTOrl8f-n_oLME7LXw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Efficient+Approximation+Algorithms+for+Several+Positive+Influence+Dominating+Set+Problems+in+Social+Networks&rft.jtitle=IEEE+transactions+on+computational+social+systems&rft.au=Zhong%2C+Hao&rft.au=Li%2C+Weisheng&rft.au=Zhang%2C+Qi&rft.au=Lin%2C+Ronghua&rft.date=2025-10-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.eissn=2373-7476&rft.volume=12&rft.issue=5&rft.spage=2930&rft.epage=2939&rft_id=info:doi/10.1109%2FTCSS.2025.3541230&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2329-924X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2329-924X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2329-924X&client=summon