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

zbMATH Keywords

approximation algorithmcomplex networkcardinality constrainedcritical node detection problemrandomized

Mathematics Subject Classification ID

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)

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

Cites Work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3862999 (Why is no real title available?)
• A derandomized approximation algorithm for the critical node detection problem
• Approximability of the firefighter problem. Computing cuts over time
• Approximate max-flow min-(multi)cut theorems and their applications
• Branch and cut algorithms for detecting critical nodes in undirected graphs
• Cardinality constrained and multicriteria (multi)cut problems
• Collective dynamics of `small-world' networks
• Complexity of the critical node problem over trees
• Cut Problems in Graphs with a Budget Constraint
• Detecting critical nodes in sparse graphs
• Emergence of Scaling in Random Networks
• Expander flows, geometric embeddings and graph partitioning
• Expander flows, geometric embeddings and graph partitioning
• Finding k Cuts within Twice the Optimal
• Fragmentability of graphs
• Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
• Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
• Inoculation strategies for victims of viruses and the sum-of-squares partition problem
• Networks. An introduction.
• Primal-dual approximation algorithms for integral flow and multicut in trees
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs

Cited In (15)

• EIA-CNDP: an exact iterative algorithm for 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
• A region growing algorithm for detecting critical nodes
• Reducing disease spread through optimization: limiting mixture of the population is more important than limiting group sizes
• Literature review: the vaccine supply chain
• On the firefighter problem with spreading vaccination for maximizing the number of saved nodes: the IP model and LP rounding algorithms
• Fair allocation of personal protective equipment to health centers during early phases of a pandemic
• A bicriteria approximation algorithm for quarantining-vaccination-cure problem
• The bi-objective critical node detection problem
• The critical node detection problem in networks: a survey
• A fast greedy algorithm for the critical node detection problem
• Relaxation and matrix randomized rounding for the maximum spectral subgraph problem

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)