Target set selection for conservative populations

DOI10.1016/J.DAM.2021.09.003MaRDI QIDQ2235265zbMATH OpenOpenAlexFDO

Authors Shimon Kogan, Uriel Feige

Publication date 21 October 2021

Published in Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

target set selection

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Graph theory (05Cxx)

Recommendations

• scientific article; zbMATH DE number 846018
• Effectively Selecting a Target Population for a Future Comparative Study
• Simultaneous Selection of Extreme Populations: A Subset Selection Approach
• A subset selection procedure for exponential populations
• On approximating target set selection
• Asymptotic consistency of procedures for selecting good populations
• On subset selection from logistic populations

Cites work

• scientific article; zbMATH DE number 6474901 (Why is no real title available?)
• A \(c^k n\) 5-approximation algorithm for treewidth
• A contraction algorithm for finding small cycle cutsets
• Beating the random ordering is hard: every ordering CSP is approximation resistant
• Combinatorial model and bounds for target set selection
• Hardness of vertex deletion and project scheduling
• Improved Approximation Algorithms for Minimum Weight Vertex Separators
• Irreversible 2-conversion set in graphs of bounded degree
• Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
• Linearity of grid minors in treewidth with applications through bidimensionality
• Minimum weakly fundamental cycle bases are hard to find
• On approximating target set selection
• On some tractable and hard instances for partial incentives and target set selection
• On the approximability of influence in social networks
• On the hardness of approximating label-cover
• On the power of unique 2-prover 1-round games
• Optimizing spread of influence in social networks via partial incentives
• Packing directed circuits fractionally
• Parameterized inapproximability of target set selection and generalizations
• Simple proof of hardness of feedback vertex set
• Target set selection for conservative populations
• Treewidth governs the complexity of target set selection

Cited in

(6)

• On reconfigurability of target sets
• Target set selection for conservative populations
• Spread of influence with incentives in edge-weighted graphs with emphasis on some families of graphs
• Parameterized complexity of immunization in the threshold model
• Immunization in the threshold model: a parameterized complexity study
• On approximating the rank of graph divisors

This page was built for publication: Target set selection for conservative populations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2235265)