Pages that link to "Item:Q2168709"
From MaRDI portal
The following pages link to A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks (Q2168709):
Displaying 8 items.
- Approximation algorithm for partial positive influence problem in social network (Q511731) (← links)
- On positive influence dominating sets in social networks (Q621845) (← links)
- On the approximability of positive influence dominating set in social networks (Q2015789) (← links)
- An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks (Q2150397) (← links)
- (Q3194249) (← links)
- Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem (Q5087709) (← links)
- A unified greedy approximation for several dominating set problems (Q6093579) (← links)
- An efficient local search algorithm for minimum positive influence dominating set problem (Q6109569) (← links)