Asymptotic quasi-polynomial time approximation scheme for resource minimization for fire containment
From MaRDI portal
Publication:2165027
DOI10.1007/s00453-022-00972-6OpenAlexW3013656193MaRDI QIDQ2165027
Mohammad R. Salavatipour, Mirmahdi Rahgoshay
Publication date: 18 August 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-022-00972-6
approximation algorithmresource managementfirefighter problemasymptotic approximation schemefire containment
Cites Work
- Unnamed Item
- Unnamed Item
- The firefighter problem for cubic graphs
- The firefighter problem for graphs of maximum degree three
- Approximability of the firefighter problem. Computing cuts over time
- New Integrality Gap Results for the Firefighters Problem on Trees
- Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
- Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm
- Firefighting on Trees Beyond Integrality Gaps
- Improved Hardness for Cut, Interdiction, and Firefighter Problems