Target set selection for conservative populations
From MaRDI portal
Publication:2235265
DOI10.1016/J.DAM.2021.09.003OpenAlexW3199635385MaRDI QIDQ2235265FDOQ2235265
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
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
- Minimum weakly fundamental cycle bases are hard to find
- On the approximability of influence in social networks
- Combinatorial model and bounds for target set selection
- Treewidth governs the complexity of target set selection
- Title not available (Why is that?)
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- On the power of unique 2-prover 1-round games
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Beating the random ordering is hard: every ordering CSP is approximation resistant
- Linearity of grid minors in treewidth with applications through bidimensionality
- On the hardness of approximating label-cover
- Packing directed circuits fractionally
- A \(c^k n\) 5-approximation algorithm for treewidth
- Parameterized inapproximability of target set selection and generalizations
- A contraction algorithm for finding small cycle cutsets
- Optimizing spread of influence in social networks via partial incentives
- Irreversible 2-conversion set in graphs of bounded degree
- On approximating target set selection
- On some tractable and hard instances for partial incentives and target set selection
- Target set selection for conservative populations
- Simple proof of hardness of feedback vertex set
- Hardness of vertex deletion and project scheduling
Cited In (6)
- On reconfigurability of target sets
- Spread of influence with incentives in edge-weighted graphs with emphasis on some families of graphs
- Target set selection for conservative populations
- 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)
