Toward Optimal Approximations for Resource-Minimization for Fire Containment on Trees and Non-Uniform k-Center
Jannis Blauth, Christian N\"obel, Rico Zenklusen

TL;DR
This paper presents optimal approximation algorithms for resource minimization in fire containment on trees and extends these techniques to the non-uniform k-center problem, resolving key open questions.
Contribution
It provides the first optimal 2-approximation and asymptotic PTAS for RMFC on trees, and introduces new methods applicable to non-uniform k-center problems.
Findings
Achieved an optimal 2-approximation for RMFC.
Developed an asymptotic PTAS for a smooth variant of RMFC.
First approximation algorithm for NUkC with optimal number of additional centers.
Abstract
One of the most elementary spreading models on graphs can be described by a fire spreading from a burning vertex in discrete time steps. At each step, all neighbors of burning vertices catch fire. A well-studied extension to model fire containment is to allow for fireproofing a number of non-burning vertices at each step. Interestingly, basic computational questions about this model are computationally hard even on trees. One of the most prominent such examples is Resource Minimization for Fire Containment (RMFC), which asks how small can be chosen so that a given subset of vertices will never catch fire. Despite recent progress on RMFC on trees, prior work left a significant gap in terms of its approximability. We close this gap by providing an optimal -approximation and an asymptotic PTAS, resolving two open questions in the literature. Both results are obtained in a…
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
TopicsComplexity and Algorithms in Graphs · Vehicle Routing Optimization Methods · Advanced Graph Theory Research
