Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems

Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems

Let R denote a connected region inside a simple polygon, P. By building barriers (typically straight-line segments) in P \ R , we want to separate from R part(s) of...

Full description

Bibliographic Details
Main Authors: Rolf Klein, Christos Levcopoulos, Andrzej Lingas
Format: Article
Language:English
Published: MDPI AG 2018-04-01
Series:Algorithms
Subjects:
budget fence problem
firefighter problem
PTAS
scheduling
set cover
time complexity
Online Access:http://www.mdpi.com/1999-4893/11/4/45

Internet

http://www.mdpi.com/1999-4893/11/4/45

Similar Items