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 P of maximum area. All edges of the boundary of P are assumed to be already constructed or natural barriers. In this paper we introduce two versions of this problem. In the budget fence version the region R is static, and there is an uppe