On the approximability of positive influence dominating set in social networks
In social networks, there is a tendency for connected users to match each other's behaviors.
Moreover, a user likely adopts a behavior, if a certain fraction of his family and friends …
Moreover, a user likely adopts a behavior, if a certain fraction of his family and friends …
Non-submodular maximization on massive data streams
Y Wang, D Xu, Y Wang, D Zhang - Journal of Global Optimization, 2020 - Springer
The problem of maximizing a normalized monotone non-submodular set function subject to
a cardinality constraint arises in the context of extracting information from massive streaming …
a cardinality constraint arises in the context of extracting information from massive streaming …
Solving the connected dominating set problem and power dominating set problem by integer programming
In this paper, we propose several integer programming approaches with a polynomial
number of constraints to formulate and solve the minimum connected dominating set …
number of constraints to formulate and solve the minimum connected dominating set …
Influence maximization in social networks under deterministic linear threshold model
We define the new Targeted and Budgeted Influence Maximization under Deterministic
Linear Threshold Model problem and develop the novel and scalable TArgeted and …
Linear Threshold Model problem and develop the novel and scalable TArgeted and …
Spreading social influence with both positive and negative opinions in online networks
Spreading social influence with both positive and negative opinions in online networks
Social networks are important media for spreading information, ideas, and influence among …
Social networks are important media for spreading information, ideas, and influence among …
An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks
G Lin, J Guan, H Feng - Physica A: Statistical Mechanics and its …, 2018 - Elsevier
The positive influence dominating set problem is a variant of the minimum dominating set
problem, and has lots of applications in social networks. It is NP-hard, and receives more …
problem, and has lots of applications in social networks. It is NP-hard, and receives more …
Minimum edge blocker dominating set problem
This paper introduces and studies the minimum edge blocker dominating set problem
(EBDP), which is formulated as follows. Given a vertex-weighted undirected graph and r> 0 …
(EBDP), which is formulated as follows. Given a vertex-weighted undirected graph and r> 0 …
Minimum-sized influential node set selection for social networks under the independent cascade model
Social networks are important mediums for communication, information dissemination, and
influence spreading. Most of existing works focus on understanding the characteristics of …
influence spreading. Most of existing works focus on understanding the characteristics of …
Influence maximization with latency requirements on social networks
S Raghavan, R Zhang - INFORMS Journal on Computing, 2022 - pubsonline.informs.org
Targeted marketing strategies are of significant interest in the smartapp economy. Typically,
one seeks to identify individuals to strategically target in a social network so that the network …
one seeks to identify individuals to strategically target in a social network so that the network …
A hybrid swarm intelligence-based algorithm for finding minimum positive influence dominating sets
G Lin, J Luo, H Xu, M Xu - … in Natural Computation, Fuzzy Systems and …, 2020 - Springer
The minimum positive influence dominating set problem is one of the central problems in the
study of online social networks. This paper presents a hybrid swarm intelligence-based …
study of online social networks. This paper presents a hybrid swarm intelligence-based …