65 citations · 126 across the 4 of their papers we have counts for
Showing cs.SIShow all
3 papers · 1 filter
cs.SI2020★ 3 cited
Efficient Approximation Algorithms for Adaptive Influence Maximization
Keke Huang, Jing Tang, Kai Han +5
Given a social network and an integer , the influence maximization (IM) problem asks for a seed set of nodes from to maximize the expected number of nodes influe…
cs.SI2019★ 1 cited
Efficient Approximation Algorithms for Adaptive Target Profit Maximization
Keke Huang, Jing Tang, Xiaokui Xiao +2
Given a social network , the profit maximization (PM) problem asks for a set of seed nodes to maximize the profit, i.e., revenue of influence spread less the cost of seed select…
cs.SI2019
Efficient Approximation Algorithms for Adaptive Seed Minimization
Jing Tang, Keke Huang, Xiaokui Xiao +4
As a dual problem of influence maximization, the seed minimization problem asks for the minimum number of seed nodes to influence a required number of users in a given social n…