Abstract
Continuous and discrete models as well as algorithms Bressan (2007) and Finbow and MacGillivray (2009) for firefighting problems are well-studied in Theoretical Computer Science. We introduce a new, discrete, and more general framework based on a graph to study firefighting problems in various terrains. In the context of this model, we present two different firefighting problems called village protection problems, where the goal is to protect a specific set of locations and provide efficient polynomial time algorithms for their solutions. We also discuss extensions of the model.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.