Firefighting on Trees Beyond Integrality Gaps
David Adjiashvili, Andrea Baggio, Rico Zenklusen

TL;DR
This paper advances the understanding of the Firefighter and RMFC problems on trees by providing a PTAS and an improved approximation, leveraging new techniques to enhance LP relaxations.
Contribution
It introduces a PTAS for the Firefighter problem and an O(1)-approximation for RMFC on trees, surpassing previous approximation ratios.
Findings
Established a PTAS for the Firefighter problem.
Achieved an O(1)-approximation for RMFC.
Combined LP relaxations with new enumeration techniques.
Abstract
The Firefighter problem and a variant of it, known as Resource Minimization for Fire Containment (RMFC), are natural models for optimal inhibition of harmful spreading processes. Despite considerable progress on several fronts, the approximability of these problems is still badly understood. This is the case even when the underlying graph is a tree, which is one of the most-studied graph structures in this context and the focus of this paper. In their simplest version, a fire spreads from one fixed vertex step by step from burning to adjacent non-burning vertices, and at each time step, many non-burning vertices can be protected from catching fire. The Firefighter problem asks, for a given , to maximize the number of vertices that will not catch fire, whereas RMFC (on a tree) asks to find the smallest that allows for saving all leaves of the tree. Prior to this work, the best…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs · Vehicle Routing Optimization Methods
