Pages that link to "Item:Q511731"
From MaRDI portal
The following pages link to Approximation algorithm for partial positive influence problem in social network (Q511731):
Displaying 12 items.
- Connected positive influence dominating set in \(k\)-regular graph (Q2004078) (← links)
- Approximation algorithm for the partial set multi-cover problem (Q2010112) (← links)
- A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem (Q2080830) (← links)
- A primal-dual algorithm for the minimum power partial cover problem (Q2082206) (← links)
- Measuring the influence and amplification of users on social network with unsupervised behaviors learning and efficient interaction-based knowledge graph (Q2084652) (← 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 bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (Q2282997) (← links)
- An approximation algorithm for the partial covering 0-1 integer program (Q2297657) (← 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)
- Breaking the<i>r</i><sub>max</sub>Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem (Q4995101) (← links)
