Math‐based reinforcement learning for the adaptive budgeted influence maximization problem
From MaRDI portal
Recommendations
Cites work
- A two-stage stochastic programming approach for influence maximization in social networks
- Adaptive seeding for profit maximization in social networks
- Adaptive submodularity: theory and applications in active learning and stochastic optimization
- An information spreading model based on online social networks
- Approximate dynamic programming. Solving the curses of dimensionality
- Automata, Languages and Programming
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters
- scientific article; zbMATH DE number 5485445 (Why is no real title available?)
- Large-scale influence maximization via maximal covering location
- Maximizing social influence in nearly optimal time
- Optimal Social Influence
- Statistical mechanics of complex networks
- The polynomial robust knapsack problem
Cited in
(2)
This page was built for publication: Math‐based reinforcement learning for the adaptive budgeted influence maximization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6196896)