Approximation algorithms for the geometric firefighter and budget fence problems

DOI10.1007/978-3-642-54423-1_23MaRDI QIDQ5405045zbMATH OpenOpenAlexFDO

Authors Rolf Klein, Christos Levcopoulos, Andrzej Lingas

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

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

Recommendations

• Approximation algorithms for the geometric firefighter and budget fence problems
• Finding exact solutions for the geometric firefighter problem in practice
• Geometric firefighting in the half-plane
• Geometric firefighting in the half-plane
• Fast fencing

Cited in

(7)

• Solving the geometric firefighter routing problem via integer programming
• Finding exact solutions for the geometric firefighter problem in practice
• On the complexity of barrier resilience for fat regions and bounded ply
• A near-quadratic algorithm for fence design
• On a fire fighter's problem
• Multilevel approaches for the critical node problem
• Approximation algorithms for the geometric firefighter and budget fence problems

This page was built for publication: Approximation algorithms for the geometric firefighter and budget fence problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405045)