Target set selection parameterized by vertex cover and more

DOI10.1007/s00224-022-10100-0OpenAlexW3161210952MaRDI QIDQ2082561

Fahad Panolan, Suman Banerjee, Rogers Mathew

Publication date: 4 October 2022

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.01482

zbMATH Keywords

integer programmingvertex covertarget set selectionFPT

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Diffusion (76R50)

Cites Work

• Unnamed Item
• Unnamed Item
• Treewidth governs the complexity of target set selection
• Some results on the target set selection problem
• Constant thresholds can make target set selection tractable
• Latency-bounded target set selection in social networks
• Integer Programming with a Fixed Number of Variables
• On the Approximability of Influence in Social Networks
• Solving Target Set Selection with Bounded Thresholds Faster than 2^n
• Target Set Selection Parameterized by Clique-Width and Maximum Threshold
• Parameterized Inapproximability of Target Set Selection and Generalizations
• Parameterized Algorithms

This page was built for publication: Target set selection parameterized by vertex cover and more