Pages that link to "Item:Q2428668"

The following pages link to Approximability of the firefighter problem. Computing cuts over time (Q2428668):

Displaying 14 items.

• A randomized algorithm with local search for containment of pandemic disease spread (Q337036) (← links)
• The firefighter problem: empirical results on random graphs (Q337557) (← links)
• The firefighter problem: further steps in understanding its complexity (Q527402) (← links)
• Asymptotic quasi-polynomial time approximation scheme for resource minimization for fire containment (Q2165027) (← links)
• Firefighting on trees (Q2328866) (← links)
• Approximation algorithms for the geometric firefighter and budget fence problems (Q2331446) (← links)
• Approximation algorithms for fragmenting a graph against a stochastically-located threat (Q2344215) (← links)
• On efficient vaccine distribution strategy to suppress pandemic using social relation (Q2798324) (← links)
• The Firefighter Problem: A Structural Analysis (Q2946017) (← links)
• New Integrality Gap Results for the Firefighters Problem on Trees (Q2971157) (← links)
• Firefighting as a Strategic Game (Q5856433) (← links)
• APX-hardness and approximation for the \(k\)-burning number problem (Q5918792) (← links)
• APX-hardness and approximation for the \(k\)-burning number problem (Q5919106) (← links)
• A matheuristic for the firefighter problem on graphs (Q6067888) (← links)