@article{ZHANG2025, 
author = {Longjiao ZHANG and Bingyang FU and Qihao SHI and Mingli SONG and Can WANG and Yue ZHANG},
title = {Adaptive strategy for boosting node costs minimization in multi-round influence},
year = {2025},
journal = {Journal of National University of Defense Technology},
volume = {47},
number = {3},
pages = {21-31},
keywords = {social network, influence maximization, boosting influence spread, boosting node, costs minimization},
url = {https://www.sciopen.com/article/10.11887/j.cn.202503003},
doi = {10.11887/j.cn.202503003},
abstract = {In order to reduce the marketing costs of merchants promoting products over multiple rounds on social networks, this study made a exploration on the selection of boosting nodes during the process of multi-round influence propagation. Based on the model of multi-round influence boosting propagation mode, an adaptive strategy for choosing boosting nodes was designed. Given known seed nodes, this strategy could find an efficient method to minimize the number of marketing rounds needed to reach a certain threshold of social influence, with nearly linear algorithmic complexity. Experimental results show that compared to existing heuristic algorithms and non-adaptive algorithms, the designed adaptive strategy can reduce the promotion rounds required to reach a specified threshold by 7.3% ~ 18.3%, effectively reducing the promotion cost.}
}