Influence Minimization via Blocking Strategies.

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος:	Influence Minimization via Blocking Strategies.
Συγγραφείς:	Xie, Jiadong¹ (AUTHOR) jdxie@se.cuhk.edu.hk, Zhang, Fan² (AUTHOR) zhangf@gzhu.edu.cn, Wang, Kai³ (AUTHOR) w.kai@sjtu.edu.cn, Liu, Jialu³ (AUTHOR) jialuliu@sjtu.edu.cn, Lin, Xuemin³ (AUTHOR) xuemin.lin@sjtu.edu.cn, Zhang, Wenjie⁴ (AUTHOR) wenjie.zhang@unsw.edu.au
Πηγή:	INFORMS Journal on Computing. Nov/Dec2025, Vol. 37 Issue 6, p1587-1604. 18p.
Θεματικοί όροι:	Heuristic algorithms, Greedy algorithms, Communication network analysis
Περίληψη:	We study the influence minimization problem: given a graph G and a seed set S, blocking at most b nodes or b edges such that the influence spread of seed set is minimized. This is a pivotal yet underexplored aspect of network analytics, which can limit the spread of undesirable phenomena in networks, such as misinformation and epidemics. Given the inherent NP-hardness of the problem under the independent cascade and linear threshold models, previous studies have employed greedy algorithms and Monte Carlo Simulations for its resolution. However, existing techniques become cost-prohibitive when applied to large networks due to the necessity of enumerating all the candidate blockers and computing the decrease in expected spread from blocking each of them. This significantly restricts the practicality and effectiveness of existing methods, especially when prompt decision making is crucial. In this paper, we propose the AdvancedGreedy algorithm, which utilizes a novel graph sampling technique that incorporates the dominator tree structure. We find that AdvancedGreedy can achieve a (1−1/e−ϵ) -approximation in the problem under the linear threshold model. For the problem under the independent cascade model, we further propose a novel heuristic algorithm GreedyReplace, based on identifying the relationships among candidate blockers. Experimental evaluations on real-life networks reveal that our proposed algorithms exhibit a significant enhancement in efficiency, surpassing the state-of-the-art algorithm by three orders of magnitude while achieving high effectiveness. History: Accepted by Erwin Pesch, Area Editor for Heuristic Search & Approximation Algorithms. Funding: K. Wang was supported by the National Natural Science Foundation of China [Grants 72221001 and 62302294]. J. Liu was supported by the National Natural Science Foundation of China [Grants 72221001 and 72402127] and Shanghai Pujiang Program [Grant 23PJC059]. F. Zhang was supported by the Guangdong Basic and Applied Basic Research Foundation [Grants 2023A1515012603 and 2024A1515011501]. W. Zhang was supported by the Australian Research Council [Grant FT210100303]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0591) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2024.0591). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]
	Copyright of INFORMS Journal on Computing is the property of INFORMS: Institute for Operations Research & the Management Sciences and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Βάση Δεδομένων:	Business Source Index

FullText	Text: Availability: 0
Header	DbId: bsx DbLabel: Business Source Index An: 189856747 RelevancyScore: 1451 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 1451.22045898438
IllustrationInfo
Items	– Name: Title Label: Title Group: Ti Data: Influence Minimization via Blocking Strategies. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Xie%2C+Jiadong%22">Xie, Jiadong</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> jdxie@se.cuhk.edu.hk</i><br /><searchLink fieldCode="AR" term="%22Zhang%2C+Fan%22">Zhang, Fan</searchLink><relatesTo>2</relatesTo> (AUTHOR)<i> zhangf@gzhu.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Wang%2C+Kai%22">Wang, Kai</searchLink><relatesTo>3</relatesTo> (AUTHOR)<i> w.kai@sjtu.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Liu%2C+Jialu%22">Liu, Jialu</searchLink><relatesTo>3</relatesTo> (AUTHOR)<i> jialuliu@sjtu.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Lin%2C+Xuemin%22">Lin, Xuemin</searchLink><relatesTo>3</relatesTo> (AUTHOR)<i> xuemin.lin@sjtu.edu.cn</i><br /><searchLink fieldCode="AR" term="%22Zhang%2C+Wenjie%22">Zhang, Wenjie</searchLink><relatesTo>4</relatesTo> (AUTHOR)<i> wenjie.zhang@unsw.edu.au</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22INFORMS+Journal+on+Computing%22">INFORMS Journal on Computing</searchLink>. Nov/Dec2025, Vol. 37 Issue 6, p1587-1604. 18p. – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22Heuristic+algorithms%22">Heuristic algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Greedy+algorithms%22">Greedy algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Communication+network+analysis%22">Communication network analysis</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: We study the influence minimization problem: given a graph G and a seed set S, blocking at most b nodes or b edges such that the influence spread of seed set is minimized. This is a pivotal yet underexplored aspect of network analytics, which can limit the spread of undesirable phenomena in networks, such as misinformation and epidemics. Given the inherent NP-hardness of the problem under the independent cascade and linear threshold models, previous studies have employed greedy algorithms and Monte Carlo Simulations for its resolution. However, existing techniques become cost-prohibitive when applied to large networks due to the necessity of enumerating all the candidate blockers and computing the decrease in expected spread from blocking each of them. This significantly restricts the practicality and effectiveness of existing methods, especially when prompt decision making is crucial. In this paper, we propose the AdvancedGreedy algorithm, which utilizes a novel graph sampling technique that incorporates the dominator tree structure. We find that AdvancedGreedy can achieve a (1−1/e−ϵ) -approximation in the problem under the linear threshold model. For the problem under the independent cascade model, we further propose a novel heuristic algorithm GreedyReplace, based on identifying the relationships among candidate blockers. Experimental evaluations on real-life networks reveal that our proposed algorithms exhibit a significant enhancement in efficiency, surpassing the state-of-the-art algorithm by three orders of magnitude while achieving high effectiveness. History: Accepted by Erwin Pesch, Area Editor for Heuristic Search & Approximation Algorithms. Funding: K. Wang was supported by the National Natural Science Foundation of China [Grants 72221001 and 62302294]. J. Liu was supported by the National Natural Science Foundation of China [Grants 72221001 and 72402127] and Shanghai Pujiang Program [Grant 23PJC059]. F. Zhang was supported by the Guangdong Basic and Applied Basic Research Foundation [Grants 2023A1515012603 and 2024A1515011501]. W. Zhang was supported by the Australian Research Council [Grant FT210100303]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0591) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2024.0591). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of INFORMS Journal on Computing is the property of INFORMS: Institute for Operations Research & the Management Sciences and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink	https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=bsx&AN=189856747
RecordInfo	BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1287/ijoc.2024.0591 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 18 StartPage: 1587 Subjects: – SubjectFull: Heuristic algorithms Type: general – SubjectFull: Greedy algorithms Type: general – SubjectFull: Communication network analysis Type: general Titles: – TitleFull: Influence Minimization via Blocking Strategies. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Xie, Jiadong – PersonEntity: Name: NameFull: Zhang, Fan – PersonEntity: Name: NameFull: Wang, Kai – PersonEntity: Name: NameFull: Liu, Jialu – PersonEntity: Name: NameFull: Lin, Xuemin – PersonEntity: Name: NameFull: Zhang, Wenjie IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 11 Text: Nov/Dec2025 Type: published Y: 2025 Identifiers: – Type: issn-print Value: 10919856 Numbering: – Type: volume Value: 37 – Type: issue Value: 6 Titles: – TitleFull: INFORMS Journal on Computing Type: main
ResultId	1