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...
Main Authors: | Rolf Klein, Christos Levcopoulos, Andrzej Lingas |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-04-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | http://www.mdpi.com/1999-4893/11/4/45 |
Similar Items
-
Approximation of Euclidean k-size cycle cover problem
by: Michael Khachay, et al.
Published: (2014-12-01) -
Firefighting Equipment Arrangement Optimization for an Offshore Platform Considering Travel Distances
by: Byeong Cheol Lee, et al.
Published: (2021-05-01) -
Training fencing /
by: 271111 Barth, Bernd, et al.
Published: (2003) -
Computational Study on a PTAS for Planar Dominating Set Problem
by: Qian-Ping Gu, et al.
Published: (2013-01-01) -
The effect of fencing match sets on response and recovery of heart rate
by: Ziyad .Y.AL saffar, et al.
Published: (2005-12-01)