Pages that link to "Item:Q1650779"
From MaRDI portal
The following pages link to Least cost influence propagation in (social) networks (Q1650779):
Displaying 14 items.
- Minimizing the expected complete influence time of a social network (Q985076) (← links)
- Influence minimization in linear threshold networks (Q1737600) (← links)
- Large-scale influence maximization via maximal covering location (Q2028806) (← links)
- A polyhedral approach to least cost influence maximization in social networks (Q2111478) (← links)
- An efficient linear programming based method for the influence maximization problem in social networks (Q2224940) (← links)
- Influence maximization with deactivation in social networks (Q2424770) (← links)
- Least-Cost Influence Maximization on Social Networks (Q3386763) (← 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)
- An exact algorithm for robust influence maximization (Q5918920) (← links)
- Weighted target set selection on trees and cycles (Q6087138) (← links)
- A branch‐and‐cut approach for the least cost influence problem on social networks (Q6092651) (← links)
- Efficient presolving methods for the influence maximization problem (Q6139380) (← links)
- Benders decomposition algorithms for minimizing the spread of harmful contagions in networks (Q6568498) (← links)
