{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T00:40:50Z","timestamp":1759970450127,"version":"build-2065373602"},"reference-count":58,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T00:00:00Z","timestamp":1737244800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Social Science and Humanity on Young Fund of the Ministry of Education of China","award":["20YJC810012","62206045","61976050"],"award-info":[{"award-number":["20YJC810012","62206045","61976050"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["20YJC810012","62206045","61976050"],"award-info":[{"award-number":["20YJC810012","62206045","61976050"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems"],"abstract":"<jats:p>In recent years, social networks have become increasingly popular as platforms for personal expression, commercial transactions, and government management. The way information propagates on these networks influences the quality and expenses of social network activities, garnering substantial interest. This study addresses the enhancement of information spread in large-scale social networks constrained by resources, by framing the issue as a unique weighted k-vertex cover problem. To tackle this complex NP-hard optimization problem, a rapid local search algorithm named FastIM is introduced. A fast constructive heuristic is initially used to quickly find a starting solution, while a sampling selection method is incorporated to minimize complexity during the local search. When the algorithm stalls in local optima, a random walk operator reorients the search towards unexplored regions. Comparative tests highlight the proposed method\u2019s robustness, scalability, and efficacy in maximizing information distribution across social networks. Moreover, strategy validation trials confirm that each element of the framework enhances its overall performance.<\/jats:p>","DOI":"10.3390\/systems13010059","type":"journal-article","created":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T10:32:15Z","timestamp":1737369135000},"page":"59","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Maximizing Information Dissemination in Social Network via a Fast Local Search"],"prefix":"10.3390","volume":"13","author":[{"given":"Lijia","family":"Tian","sequence":"first","affiliation":[{"name":"School of Politics and Law, Northeast Normal University, Changchun 130117, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingjian","family":"Ji","sequence":"additional","affiliation":[{"name":"School of Information Science and Technology, Northeast Normal University, Changchun 130117, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yupeng","family":"Zhou","sequence":"additional","affiliation":[{"name":"School of Information Science and Technology, Northeast Normal University, Changchun 130117, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,1,19]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.chb.2014.04.019","article-title":"The network effect on information dissemination on social network sites","volume":"37","author":"Luarn","year":"2014","journal-title":"Comput. Hum. Behav."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"4163","DOI":"10.1007\/s11434-014-0368-5","article-title":"A survey of social network and information dissemination analysis","volume":"59","author":"Fang","year":"2014","journal-title":"Chin. Sci. Bull."},{"key":"ref_3","first-page":"20","article-title":"Big data, big questions|working within a black box: Transparency in the collection and production of big twitter data","volume":"8","author":"Driscoll","year":"2014","journal-title":"Int. J. Commun."},{"doi-asserted-by":"crossref","unstructured":"Gulati, A., and Eirinaki, M. (2018, January 10\u201313). Influence propagation for social graph-based recommendations. Proceedings of the 2018 IEEE International Conference on Big Data (Big Data), Seattle, WA, USA.","key":"ref_4","DOI":"10.1109\/BigData.2018.8622213"},{"doi-asserted-by":"crossref","unstructured":"Puthal, D., Nepal, S., Paris, C., Ranjan, R., and Chen, J. (July, January 27). Efficient algorithms for social network coverage and reach. Proceedings of the 2015 IEEE International Congress on Big Data, New York, NY, USA.","key":"ref_5","DOI":"10.1109\/BigDataCongress.2015.75"},{"doi-asserted-by":"crossref","unstructured":"Luo, C., Hoos, H.H., Cai, S., Lin, Q., Zhang, H., and Zhang, D. (2019, January 10\u201316). Local Search with Efficient Automatic Configuration for Minimum Vertex Cover. Proceedings of the IJCAI, Macau, China.","key":"ref_6","DOI":"10.24963\/ijcai.2019\/180"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1852","DOI":"10.1109\/TKDE.2018.2807843","article-title":"Influence maximization on social graphs: A survey","volume":"30","author":"Li","year":"2018","journal-title":"IEEE Trans. Knowl. Data Eng."},{"doi-asserted-by":"crossref","unstructured":"Cook, J., Eidenbenz, S., and B\u00e4rtschi, A. (2020, January 12\u201316). The quantum alternating operator ansatz on maximum k-vertex cover. Proceedings of the 2020 IEEE International Conference on Quantum Computing and Engineering (QCE), Denver, CO, USA.","key":"ref_8","DOI":"10.1109\/QCE49297.2020.00021"},{"doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., and Tardos, \u00c9. (2003, January 24\u201327). Maximizing the spread of influence through a social network. Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA.","key":"ref_9","DOI":"10.1145\/956750.956769"},{"doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., and Glance, N. (2007, January 12\u201315). Cost-effective outbreak detection in networks. Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Jose, CA, USA.","key":"ref_10","DOI":"10.1145\/1281192.1281239"},{"unstructured":"Goyal, A., Lu, W., and Lakshmanan, L.V. (April, January 28). Celf++ optimizing the greedy algorithm for influence maximization in social networks. Proceedings of the 20th International Conference Companion on World Wide Web, Hyderabad, India.","key":"ref_11"},{"doi-asserted-by":"crossref","unstructured":"Borgs, C., Brautbar, M., Chayes, J., and Lucier, B. (2014, January 5\u20137). Maximizing social influence in nearly optimal time. Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, Portland, OR, USA.","key":"ref_12","DOI":"10.1137\/1.9781611973402.70"},{"doi-asserted-by":"crossref","unstructured":"Tang, Y., Shi, Y., and Xiao, X. (June, January 31). Influence maximization in near-linear time: A martingale approach. Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, VC, Australia.","key":"ref_13","DOI":"10.1145\/2723372.2723734"},{"unstructured":"Chen, W., Wang, Y., and Yang, S. (July, January 28). Efficient influence maximization in social networks. Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France.","key":"ref_14"},{"doi-asserted-by":"crossref","unstructured":"Adineh, M., and Nouri-Baygi, M. (2018, January 25\u201326). Maximum degree based heuristics for influence maximization. Proceedings of the 2018 8th International Conference on Computer and Knowledge Engineering (ICCKE), Mashhad, Iran.","key":"ref_15","DOI":"10.1109\/ICCKE.2018.8566515"},{"doi-asserted-by":"crossref","unstructured":"Galhotra, S., Arora, A., Virinchi, S., and Roy, S. (2015, January 18\u201322). Asim: A scalable algorithm for influence maximization under the independent cascade model. Proceedings of the 24th International Conference on World Wide Web, Florence, Italy.","key":"ref_16","DOI":"10.1145\/2740908.2742725"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.tcs.2018.02.024","article-title":"Active influence spreading in social networks","volume":"764","author":"Cordasco","year":"2019","journal-title":"Theor. Comput. Sci."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"103161","DOI":"10.1016\/j.ipm.2022.103161","article-title":"An efficient adaptive degree-based heuristic algorithm for influence maximization in hypergraphs","volume":"60","author":"Xie","year":"2023","journal-title":"Inf. Processing Manag."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"110062","DOI":"10.1016\/j.asoc.2023.110062","article-title":"ABEM: An adaptive agent-based evolutionary approach for influence maximization in dynamic social networks","volume":"136","author":"Li","year":"2023","journal-title":"Appl. Soft Comput."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.ins.2020.12.048","article-title":"An MCDM integrated adaptive simulated annealing approach for influence maximization in social networks","volume":"556","author":"Biswas","year":"2021","journal-title":"Inf. Sci."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"108750","DOI":"10.1016\/j.asoc.2022.108750","article-title":"Solving the robust influence maximization problem on multi-layer networks via a Memetic algorithm","volume":"121","author":"Wang","year":"2022","journal-title":"Appl. Soft Comput."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"112971","DOI":"10.1016\/j.eswa.2019.112971","article-title":"Identification of influential users in social network using gray wolf optimization algorithm","volume":"142","author":"Zareie","year":"2020","journal-title":"Expert Syst. Appl."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"105554","DOI":"10.1016\/j.asoc.2019.105554","article-title":"LAPSO-IM: A learning-based influence maximization approach for social networks","volume":"82","author":"Singh","year":"2019","journal-title":"Appl. Soft Comput."},{"unstructured":"Jiang, Q., Song, G., Gao, C., Wang, Y., Si, W., and Xie, K. (2011, January 7\u201311). Simulated annealing based influence maximization in social networks. Proceedings of the the AAAI Conference on Artificial Intelligence, San Francisco, CA, USA.","key":"ref_24"},{"doi-asserted-by":"crossref","unstructured":"Tsai, C.W., Yang, Y.C., and Chiang, M.C. (2015, January 9\u201312). A genetic newgreedy algorithm for influence maximization in social network. Proceedings of the 2015 IEEE International Conference on Systems, Man, and Cybernetics, Kowloon Tong, Hong Kong.","key":"ref_25","DOI":"10.1109\/SMC.2015.446"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"123429","DOI":"10.1016\/j.eswa.2024.123429","article-title":"A survey on influence maximization models","volume":"248","author":"Jaouadi","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1409","DOI":"10.1007\/s40747-023-01220-2","article-title":"Customized influence maximization in attributed social networks: Heuristic and meta-heuristic algorithms","volume":"10","author":"Liang","year":"2024","journal-title":"Complex Intell. Syst."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"e12676","DOI":"10.1111\/exsy.12676","article-title":"A novel meta-heuristic approach for influence maximization in social networks","volume":"40","author":"Chatterjee","year":"2023","journal-title":"Expert Syst."},{"key":"ref_29","first-page":"1","article-title":"Cuckoo search optimization-based influence maximization in dynamic social networks","volume":"18","author":"Singh","year":"2024","journal-title":"ACM Trans. Web"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"10829","DOI":"10.1007\/s10489-021-02880-8","article-title":"Influence maximization based on community structure and second-hop neighborhoods","volume":"52","author":"Cheng","year":"2022","journal-title":"Appl. Intell."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2532549","article-title":"CIM: Community-based influence maximization in social networks","volume":"5","author":"Chen","year":"2014","journal-title":"ACM Trans. Intell. Syst. Technol. (TIST)"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"1601","DOI":"10.1016\/j.neucom.2017.10.007","article-title":"Community-based seeds selection algorithm for location aware influence maximization","volume":"275","author":"Li","year":"2018","journal-title":"Neurocomputing"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"205","DOI":"10.3233\/IDA-205566","article-title":"ComIM: A community-based algorithm for influence maximization under the weighted cascade model on social networks","volume":"26","author":"Qiu","year":"2022","journal-title":"Intell. Data Anal."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"118869","DOI":"10.1016\/j.eswa.2022.118869","article-title":"FIP: A fast overlapping community-based Influence Maximization Algorithm using probability coefficient of global diffusion in social networks","volume":"213","author":"Bouyer","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3664618","article-title":"DCDIMB: Dynamic community-based diversified influence maximization using bridge nodes","volume":"18","author":"Meena","year":"2024","journal-title":"ACM Trans. Web"},{"doi-asserted-by":"crossref","unstructured":"Goel, S., Watts, D., and Goldstein, D. (2012, January 4\u20138). The structure of online diffusion networks. Proceedings of the 13th ACM Conference on Electronic Commerce, Valencia, Spain.","key":"ref_36","DOI":"10.1145\/2229012.2229058"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"8721","DOI":"10.1007\/s10489-021-02818-0","article-title":"Multi-hop analysis method for rich-club phenomenon of influence maximization in social networks","volume":"52","author":"Duan","year":"2022","journal-title":"Appl. Intell."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.eswa.2018.05.001","article-title":"Influence maximization in social networks based on TOPSIS","volume":"108","author":"Zareie","year":"2018","journal-title":"Expert Syst. Appl."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"1491","DOI":"10.1016\/j.future.2017.05.050","article-title":"Maximizing positive influence spread in online social networks via fluid dynamics","volume":"86","author":"Wang","year":"2018","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_40","first-page":"817","article-title":"On the optimal solution of budgeted influence maximization problem in social networks","volume":"19","year":"2019","journal-title":"Oper. Res."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/s10107-020-01507-z","article-title":"An exact algorithm for robust influence maximization","volume":"183","author":"Nannicini","year":"2020","journal-title":"Math. Program."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.neucom.2020.07.028","article-title":"InfGCN: Identifying influential nodes in complex networks with graph convolutional networks","volume":"414","author":"Zhao","year":"2020","journal-title":"Neurocomputing"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"1617","DOI":"10.1016\/j.ins.2022.06.075","article-title":"Influence maximization in social networks using graph embedding and graph neural network","volume":"607","author":"Kumar","year":"2022","journal-title":"Inf. Sci."},{"doi-asserted-by":"crossref","unstructured":"Rezvanian, A., Vahidipour, S.M., and Meybodi, M.R. (2023). A new stochastic diffusion model for influence maximization in social networks. Sci. Rep., 13.","key":"ref_44","DOI":"10.1038\/s41598-023-33010-8"},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/s11227-024-06621-9","article-title":"DGN: Influence maximization based on deep reinforcement learning","volume":"81","author":"Wang","year":"2025","journal-title":"J. Supercomput."},{"key":"ref_46","first-page":"1","article-title":"A survey on influence maximization: From an ml-based combinatorial optimization","volume":"17","author":"Li","year":"2023","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"1379","DOI":"10.1109\/TPDS.2014.2320515","article-title":"Influence maximization on large-scale mobile social network: A divide-and-conquer method","volume":"26","author":"Song","year":"2014","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.ins.2019.04.033","article-title":"Identification of influential users in social networks based on users\u2019 interest","volume":"493","author":"Zareie","year":"2019","journal-title":"Inf. Sci."},{"doi-asserted-by":"crossref","unstructured":"Javad-Kalbasi, M., Dabiri, K., Valaee, S., and Sheikholeslami, A. (2019, January 12\u201317). Digitally annealed solution for the vertex cover problem with application in cyber security. Proceedings of the ICASSP 2019-2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Brighton, UK.","key":"ref_49","DOI":"10.1109\/ICASSP.2019.8683696"},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"114168","DOI":"10.1016\/j.eswa.2020.114168","article-title":"An efficient path-based approach for influence maximization in social networks","volume":"167","author":"Kianian","year":"2021","journal-title":"Expert Syst. Appl."},{"doi-asserted-by":"crossref","unstructured":"Yigit, Y., Dagdeviren, O., and Challenger, M. (2022). Self-Stabilizing Capacitated Vertex Cover Algorithms for Internet-of-Things-Enabled Wireless Sensor Networks. Sensors, 22.","key":"ref_51","DOI":"10.3390\/s22103774"},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1137\/1024022","article-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","volume":"24","author":"Garey","year":"1982","journal-title":"Siam Review."},{"doi-asserted-by":"crossref","unstructured":"Tu, S., and Neumann, S. (2022, January 25\u201329). A Viral Marketing-Based Model For Opinion Dynamics in Online Social Networks. Proceedings of the Proceedings of the ACM Web Conference 2022, Lyon, France.","key":"ref_53","DOI":"10.1145\/3485447.3512203"},{"unstructured":"Cai, S. (2015, January 25\u201331). Balance between complexity and quality: Local search for minimum vertex cover in massive graphs. Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, Buenos Aires, Argentina.","key":"ref_54"},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1613\/jair.3907","article-title":"NuMVC: An efficient local search algorithm for minimum vertex cover","volume":"46","author":"Cai","year":"2013","journal-title":"J. Artif. Intell. Res."},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1126\/science.1215842","article-title":"Identifying influential and susceptible members of social networks","volume":"337","author":"Aral","year":"2012","journal-title":"Science"},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"104833","DOI":"10.1016\/j.knosys.2019.07.004","article-title":"A discrete shuffled frog-leaping algorithm to identify influential nodes for influence maximization in social networks","volume":"187","author":"Tang","year":"2020","journal-title":"Knowl.-Based Syst."},{"doi-asserted-by":"crossref","unstructured":"Ma, Z., Fan, Y., Su, K., Li, C., and Sattar, A. (2016, January 6\u20138). Random walk in large real-world graphs for finding smaller vertex cover. Proceedings of the 2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI), San Jose, CA, USA.","key":"ref_58","DOI":"10.1109\/ICTAI.2016.0109"}],"container-title":["Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2079-8954\/13\/1\/59\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T10:31:39Z","timestamp":1759919499000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2079-8954\/13\/1\/59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,19]]},"references-count":58,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,1]]}},"alternative-id":["systems13010059"],"URL":"https:\/\/doi.org\/10.3390\/systems13010059","relation":{},"ISSN":["2079-8954"],"issn-type":[{"type":"electronic","value":"2079-8954"}],"subject":[],"published":{"date-parts":[[2025,1,19]]}}}