Pages that link to "Item:Q6092651"
From MaRDI portal
The following pages link to A branch‐and‐cut approach for the least cost influence problem on social networks (Q6092651):
Displaying 5 items.
- A polyhedral approach to least cost influence maximization in social networks (Q2111478) (← links)
- Influence Maximization with Latency Requirements on Social Networks (Q5085986) (← links)
- Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem (Q5087709) (← links)
- Benders decomposition algorithms for minimizing the spread of harmful contagions in networks (Q6568498) (← links)
- Spread of influence with incentives in edge-weighted graphs with emphasis on some families of graphs (Q6571269) (← links)
