Influence maximization problem: properties and algorithms-Reference-Cited by-同舟云学术

Influence maximization problem: properties and algorithms

Published:2020-08-26 Issue:4 Volume:40 Page:907-928
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Yang Wenguo^ORCID,Zhang Yapu,Du Ding-Zhu

Funder

National Natural Science Foundation of China

National Science Foundation

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

https://link.springer.com/content/pdf/10.1007/s10878-020-00638-5.pdf

Reference24 articles.

1. Borgs C, Brautbar M, Chayes J, Lucier B (2014) Maximizing social influence in nearly optimal time. In: SODA, pp 946–957

2. Chaoji V, Ranu S, Rastogi R, Bhatt R (2012) Recommendations to boost content spread in social networks. In: WWW, pp 529–538

3. Chen W, Wang C, Wang Y (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: KDD, pp 1029–1038

4. Cornuejols G, Fisher M, Nemhauser G (1977) Location of bank accounts to optimize float. Manag Sci 23:789–810

5. Domingos P, Richardson M (2001) Mining the network value of customers. In: Seventh international conference on knowledge discovery and data mining

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Target Group Influence Maximization using Reinforcement Learning Approach;2024 10th International Conference on Web Research (ICWR);2024-04-24

2. A unified embedding-based relation completion framework for knowledge graph;Knowledge-Based Systems;2024-04

3. Research on the Influence Maximization Problem in Social Networks Based on the Multi-Functional Complex Networks Model;Journal of Organizational and End User Computing;2022-06-15

4. Nonsubmodular constrained profit maximization from increment perspective;Journal of Combinatorial Optimization;2021-07-05

5. Novel algorithms for maximum DS decomposition;Theoretical Computer Science;2021-02