A randomized algorithm with local search for containment of pandemic disease spread
DOI10.1016/J.COR.2014.02.003zbMATH Open1348.92011OpenAlexW2071159824MaRDI QIDQ337036FDOQ337036
Authors: M. Ventresca, Dionne M. Aleman 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.02.003
Recommendations
- A derandomized approximation algorithm for the critical node detection problem
- A region growing algorithm for detecting critical nodes
- scientific article; zbMATH DE number 7059791
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
- A bicriteria approximation algorithm for quarantining-vaccination-cure problem
approximation algorithmcomplex networkcardinality constrainedcritical node detection problemrandomized
Epidemiology (92D30) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Computational methods for problems pertaining to biology (92-08)
Cites Work
- Emergence of Scaling in Random Networks
- Title not available (Why is that?)
- Collective dynamics of ‘small-world’ networks
- Networks. An introduction.
- Title not available (Why is that?)
- Expander flows, geometric embeddings and graph partitioning
- Detecting critical nodes in sparse graphs
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- A derandomized approximation algorithm for the critical node detection problem
- Complexity of the critical node problem over trees
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Cardinality constrained and multicriteria (multi)cut problems
- Fragmentability of graphs
- Approximate max-flow min-(multi)cut theorems and their applications
- Expander flows, geometric embeddings and graph partitioning
- Approximability of the firefighter problem. Computing cuts over time
- Inoculation strategies for victims of viruses and the sum-of-squares partition problem
- Cut Problems in Graphs with a Budget Constraint
- Finding k Cuts within Twice the Optimal
- Primal-dual approximation algorithms for integral flow and multicut in trees
Cited In (11)
- EIA-CNDP: an exact iterative algorithm for critical node detection problem
- A Fast Greedy Algorithm for the Critical Node Detection Problem
- Complexity of the multilevel critical node problem
- The stochastic critical node problem over trees
- A fast tri-individual memetic search approach for the distance-based critical node problem
- A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs
- Literature review: the vaccine supply chain
- A Region Growing Algorithm for Detecting Critical Nodes
- Fair allocation of personal protective equipment to health centers during early phases of a pandemic
- The bi-objective critical node detection problem
- The critical node detection problem in networks: a survey
This page was built for publication: A randomized algorithm with local search for containment of pandemic disease spread
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337036)
