Pages that link to "Item:Q2250539"

The following pages link to Parameterized approximability of maximizing the spread of influence in networks (Q2250539):

Displaying 23 items.

• The complexity of finding effectors (Q519899) (← links)
• On the complexity of reasoning about opinion diffusion under majority dynamics (Q785234) (← links)
• Optimal majority dynamics for the diffusion of an opinion when multiple alternatives are available (Q831148) (← links)
• Discovering small target sets in social networks: a fast and effective algorithm (Q1635708) (← links)
• Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
• The complexity of influence maximization problem in the deterministic linear threshold model (Q1928515) (← links)
• A note on maximizing the spread of influence in social networks (Q1944068) (← links)
• On the approximability of positive influence dominating set in social networks (Q2015789) (← links)
• On reconfigurability of target sets (Q2110378) (← links)
• Influence maximization in the presence of vulnerable nodes: a ratio perspective (Q2220831) (← links)
• Whom to befriend to influence people (Q2292915) (← links)
• Inferring local transition functions of discrete dynamical systems from observations of system behavior (Q2357112) (← links)
• Solving target set selection with bounded thresholds faster than \(2^n\) (Q2684482) (← links)
• Evangelism in Social Networks (Q2819494) (← links)
• Influence Diffusion in Social Networks under Time Window Constraints (Q2868640) (← links)
• A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths (Q2947009) (← links)
• A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths (Q4628044) (← links)
• Solving Target Set Selection with Bounded Thresholds Faster than 2^n (Q5009485) (← links)
• Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack (Q5075797) (← links)
• Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem (Q5087709) (← links)
• Beyond Worst-case (In)approximability of Nonsubmodular Influence Maximization (Q5205807) (← links)
• Message Passing Optimization of Harmonic Influence Centrality (Q5358411) (← links)
• Parameterized complexity of weighted target set selection (Q6636096) (← links)