A randomized algorithm with local search for containment of pandemic disease spread

DOI10.1016/j.cor.2014.02.003zbMath1348.92011OpenAlexW2071159824MaRDI QIDQ337036

Mario 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 networkcritical node detection problemcardinality constrainedrandomized

Mathematics Subject Classification ID

Epidemiology (92D30) Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Computational methods for problems pertaining to biology (92-08)

Related Items (11)

Complexity of the multilevel critical node problem ⋮ A Region Growing Algorithm for Detecting Critical Nodes ⋮ A Fast Greedy Algorithm for the Critical Node Detection Problem ⋮ Fair allocation of personal protective equipment to health centers during early phases of a pandemic ⋮ The bi-objective critical node detection problem ⋮ The stochastic critical node problem over trees ⋮ A fast tri-individual memetic search approach for the distance-based critical node problem ⋮ The critical node detection problem in networks: a survey ⋮ Literature review: the vaccine supply chain ⋮ EIA-CNDP: an exact iterative algorithm for critical node detection problem ⋮ A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A derandomized approximation algorithm for the critical node detection problem
• Complexity of the critical node problem over trees
• Primal-dual approximation algorithms for integral flow and multicut in trees
• Cardinality constrained and multicriteria (multi)cut problems
• Detecting critical nodes in sparse graphs
• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
• Fragmentability of graphs
• Branch and cut algorithms for detecting critical nodes in undirected graphs
• Approximability of the firefighter problem. Computing cuts over time
• Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
• Emergence of Scaling in Random Networks
• Cut Problems in Graphs with a Budget Constraint
• Finding k Cuts within Twice the Optimal
• Approximate max-flow min-(multi)cut theorems and their applications
• Collective dynamics of ‘small-world’ networks
• Expander flows, geometric embeddings and graph partitioning
• Networks
• Expander flows, geometric embeddings and graph partitioning

This page was built for publication: A randomized algorithm with local search for containment of pandemic disease spread