Stop-and-stare: Optimal sampling algorithms for viral marketing in billion-scale networks
Influence Maximization (IM), that seeks a small set of key users who spread the influence
widely into the network, is a core problem in multiple domains. It finds applications in viral …
widely into the network, is a core problem in multiple domains. It finds applications in viral …
Streaming k-submodular maximization under noise subject to size constraint
Maximizing on k-submodular functions subject to size constraint has received extensive
attention recently. In this paper, we investigate a more realistic scenario of this problem that …
attention recently. In this paper, we investigate a more realistic scenario of this problem that …
Minimum positive influence dominating set and its application in influence maximization: a learning automata approach
In recent years, with the rapid development of online social networks, an enormous amount
of information has been generated and diffused by human interactions through online social …
of information has been generated and diffused by human interactions through online social …
Influence of community structure on misinformation containment in online social networks
With the emergence of Online Social Networks (OSNs) as an effective medium of information
dissemination, its abuse in spreading misinformation has become a great concern to its …
dissemination, its abuse in spreading misinformation has become a great concern to its …
Cost-effective viral marketing for time-critical campaigns in large-scale social networks
Online social networks (OSNs) have become one of the most effective channels for
marketing and advertising. Since users are often influenced by their friends,“word-of-mouth” …
marketing and advertising. Since users are often influenced by their friends,“word-of-mouth” …
Tiptop:(almost) exact solutions for influence maximization in billion-scale networks
In this paper, we study the cost-aware target viral marketing (CTVM) problem, a
generalization of influence maximization. CTVM asks for the most cost-effective users to …
generalization of influence maximization. CTVM asks for the most cost-effective users to …
An order-based algorithm for minimum dominating set with application in graph mining
D Chalupa - Information Sciences, 2018 - Elsevier
Dominating set is a set of vertices of a graph such that all other vertices have a neighbour in
the dominating set. We propose a new order-based randomised local search (RLS o) …
the dominating set. We propose a new order-based randomised local search (RLS o) …
[HTML][HTML] An exact algorithm for the minimum dominating set problem
The Minimum Dominating Set (MDS) problem is a classic NP-hard combinatorial
optimization problem with many practical applications. Solving MDS is extremely …
optimization problem with many practical applications. Solving MDS is extremely …
A restart local search algorithm with relaxed configuration checking strategy for the minimum k-dominating set problem
The minimum k-dominating set (MKDS) problem, an extension of the classical minimum
dominating set problem, is a famous combinatorial optimization problem with a wide range …
dominating set problem, is a famous combinatorial optimization problem with a wide range …
Influence blocking maximization in social network using centrality measures
N Arazkhani, MR Meybodi… - 2019 5th Conference on …, 2019 - ieeexplore.ieee.org
Online social networks play an important role as a suitable platform for information diffusion.
While positive news diffusion on social network has a great impact in people's life, the …
While positive news diffusion on social network has a great impact in people's life, the …