Pages that link to "Item:Q5384031"
From MaRDI portal
The following pages link to Maximizing Social Influence in Nearly Optimal Time (Q5384031):
Displaying 15 items.
- Transmission errors and influence maximization in the voter model (Q5006931) (← links)
- Fairness in Influence Maximization through Randomization (Q5076357) (← links)
- Influence Maximization with Latency Requirements on Social Networks (Q5085986) (← links)
- Seeding with Costly Network Information (Q5106371) (← links)
- The Complexity of Partial Function Extension for Coverage Functions (Q5875484) (← links)
- Improved approximation algorithms for \(k\)-submodular maximization under a knapsack constraint (Q6065659) (← links)
- Uncertainty in Study of Social Networks: Robust Optimization and Machine Learning (Q6077937) (← links)
- Online conflict resolution: algorithm design and analysis (Q6084129) (← links)
- Opinion influence maximization problem in online social networks based on group polarization effect (Q6122193) (← links)
- Maximizing the influence with \(\kappa\)-grouping constraint (Q6127114) (← links)
- Fair Influence Maximization in Large-scale Social Networks Based on Attribute-aware Reverse Influence Sampling (Q6135965) (← links)
- Better bounds on the adaptivity gap of influence maximization under full-adoption feedback (Q6161475) (← links)
- IM2Vec: representation learning-based preference maximization in geo-social networks (Q6191627) (← links)
- Math‐based reinforcement learning for the adaptive budgeted influence maximization problem (Q6196896) (← links)
- Benchmarking the influential nodes in complex networks (Q6497614) (← links)
