Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems

DOI10.1007/978-3-642-54423-1_23zbMath1405.68426OpenAlexW2156459934MaRDI QIDQ5405045

Rolf Klein, Andrzej Lingas, Christos Levcopoulos

Publication date: 31 March 2014

Published in: LATIN 2014: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54423-1_23

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items

Finding exact solutions for the geometric firefighter problem in practice, On a Fire Fighter’s Problem, Solving the geometric firefighter routing problem via integer programming, Multilevel Approaches for the Critical Node Problem, Approximation algorithms for the geometric firefighter and budget fence problems