Pages that link to "Item:Q621845"

The following pages link to On positive influence dominating sets in social networks (Q621845):

Displaying 18 items.

• Approximation algorithm for partial positive influence problem in social network (Q511731) (← links)
• Connected positive influence dominating set in \(k\)-regular graph (Q2004078) (← links)
• Positive influence domination in graphs (Q2082361) (← links)
• Approximation algorithm for minimum partial multi-cover under a geometric setting (Q2115321) (← 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 bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (Q2282997) (← links)
• A primal-dual algorithm for the minimum partial set multi-cover problem (Q2307495) (← links)
• Local ratio method on partial set multi-cover (Q2410050) (← links)
• Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem (Q2940057) (← links)
• Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs (Q3088291) (← links)
• Approximation algorithm for partial set multicover versus full set multicover (Q4634530) (← links)
• Breaking the<i>r</i>_maxBarrier: 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)
• Weighted target set selection on trees and cycles (Q6087138) (← 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)