Viral marketing of online game by DS decomposition in social networks
From MaRDI portal
Publication:2282998
DOI10.1016/j.tcs.2019.03.006zbMath1443.91240OpenAlexW2921389640WikidataQ128230250 ScholiaQ128230250MaRDI QIDQ2282998
Weili Wu, Chuangen Gao, Hua Wang, Hai Du
Publication date: 27 December 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.03.006
Social networks; opinion dynamics (91D30) Applications of game theory (91A80) Marketing, advertising (90B60)
Related Items (2)
Social network analysis and applications: A review of the broad research aspects of social network structure ⋮ Rumor correction maximization problem in social networks
Cites Work
- On Bharathi-Kempe-Salek conjecture for influence maximization on arborescence
- Solution of Bharathi-Kempe-Salek conjecture for influence maximization on arborescence
- Welfare maximization and the supermodular degree
- Maximizing Non-monotone Submodular Functions
- The online set cover problem
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- An Optimal Algorithm for Monte Carlo Estimation
- Non-monotone submodular maximization under matroid and knapsack constraints
- Maximizing Social Influence in Nearly Optimal Time
- A Unified Continuous Greedy Algorithm for Submodular Maximization
This page was built for publication: Viral marketing of online game by DS decomposition in social networks