Pages that link to "Item:Q2352355"
From MaRDI portal
The following pages link to Better approximation algorithms for influence maximization in online social networks (Q2352355):
Displaying 11 items.
- On Bharathi-Kempe-Salek conjecture for influence maximization on arborescence (Q281819) (← links)
- Discovering small target sets in social networks: a fast and effective algorithm (Q1635708) (← links)
- A particle-learning-based approach to estimate the influence matrix of online social networks (Q1663084) (← links)
- On the approximability of positive influence dominating set in social networks (Q2015789) (← links)
- KATZ centrality with biogeography-based optimization for influence maximization problem (Q2185829) (← links)
- An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems (Q2354294) (← links)
- (Q3194249) (← links)
- A new heuristic for influence maximization in social networks (Q4644581) (← links)
- Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem (Q5087709) (← links)
- Social network analysis and applications: A review of the broad research aspects of social network structure (Q5101898) (← links)
- Beyond Worst-case (In)approximability of Nonsubmodular Influence Maximization (Q5205807) (← links)
