Pages that link to "Item:Q2015789"
From MaRDI portal
The following pages link to On the approximability of positive influence dominating set in social networks (Q2015789):
Displayed 19 items.
- Computing an effective decision making group of a society using social network analysis (Q489699) (← links)
- Approximation algorithm for partial positive influence problem in social network (Q511731) (← links)
- On positive-influence target-domination (Q526426) (← links)
- An order-based algorithm for minimum dominating set with application in graph mining (Q781288) (← links)
- Connected positive influence dominating set in \(k\)-regular graph (Q2004078) (← links)
- Alliances in graphs of bounded clique-width (Q2030439) (← links)
- Positive influence domination in graphs (Q2082361) (← links)
- An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks (Q2150397) (← links)
- A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks (Q2168709) (← links)
- A heuristic approximation algorithm of minimum dominating set based on rough set theory (Q2168768) (← links)
- A compact mixed integer linear formulation for safe set problems (Q2228393) (← links)
- A primal-dual algorithm for the minimum partial set multi-cover problem (Q2307495) (← links)
- On the complexity of the vector connectivity problem (Q2354404) (← links)
- Local ratio method on partial set multi-cover (Q2410050) (← links)
- The connected critical node problem (Q2672625) (← links)
- Breaking the<i>r</i><sub>max</sub>Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem (Q4995101) (← 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 efficient local search algorithm for minimum positive influence dominating set problem (Q6109569) (← links)