Target set selection parameterized by vertex cover and more
type: Item
instance of: scholarly article
title: Target set selection parameterized by vertex cover and more
author: Suman Banerjee
author: Rogers Mathew
author: Fahad Panolan
published in: Theory of Computing Systems
publication date: 2022-10-04T00:00:00Z
full work available at URL: https://arxiv.org/abs/1812.01482
Mathematics Subject Classification ID: 76R50
Mathematics Subject Classification ID: 91D30
zbMATH DE Number: 7596190
zbMATH Keywords: target set selection
zbMATH Keywords: FPT
zbMATH Keywords: vertex cover
zbMATH Keywords: integer programming
MaRDI profile type: Publication
OpenAlex ID: W3161210952
cites work: On the Approximability of Influence in Social Networks
cites work: Some results on the target set selection problem
cites work: Latency-bounded target set selection in social networks
cites work: Constant thresholds can make target set selection tractable
cites work: Q5091008
cites work: Parameterized Inapproximability of Target Set Selection and Generalizations
cites work: Target Set Selection Parameterized by Clique-Width and Maximum Threshold
cites work: Solving Target Set Selection with Bounded Thresholds Faster than 2^n
cites work: Treewidth governs the complexity of target set selection
cites work: Parameterized Algorithms
cites work: Q3002818
cites work: Integer Programming with a Fixed Number of Variables
DOI: 10.1007/S00224-022-10100-0
description: scientific article; zbMATH DE number 7596190