Algorithms and complexity of influence maximization on directed acyclic graphs
From MaRDI portal
Cites work
- A threshold of ln n for approximating set cover
- An analysis of approximations for maximizing submodular set functions-I
- Beyond Worst-case (In)approximability of Nonsubmodular Influence Maximization
- Don’t Be Greedy: Leveraging Community Structure to Find High Quality Seed Sets for Influence Maximization
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- Influence Maximization in Undirected Networks
- On Bharathi-Kempe-Salek conjecture for influence maximization on arborescence
- On the approximability of influence in social networks
- Solution of Bharathi-Kempe-Salek conjecture for influence maximization on arborescence
- Submodularity of influence in social networks: from local to global
- The PCP theorem by gap amplification
- Think globally, act locally: on the optimal seeding for nonsubmodular influence maximization
This page was built for publication: Algorithms and complexity of influence maximization on directed acyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7442722)