Complexity of minimum corridor guarding problems
نویسندگان
چکیده
منابع مشابه
Complexity of minimum corridor guarding problems
In this paper, the complexity of minimum corridor guarding problems is discussed. These problem can be described as: given a connected orthogonal arrangement of vertical and horizontal line segments and a guard with unlimited visibility along a line segment, find a tree or a closed tour with minimum total length along edges of the arrangement, such that if the guard runs on the tree or on the c...
متن کاملComplexity of the minimum-length corridor problem
We study the Minimum-Length Corridor (MLC) problem. Given a rectangular boundary partitioned into rectilinear polygons, the objective is to find a corridor of least total length. A corridor is a set of line segments each of which must lie along the line segments that form the rectangular boundary and/or the boundary of the rectilinear polygons. The corridor is a tree, and must include at least ...
متن کاملApproximation Algorithms for the Minimum-Length Corridor and Related Problems
Given a rectangular boundary partitioned into rectangles, the MLC-R problem is to find a Minimum EdgeLength Corridor that visits at least one point from the boundary of every rectangle and from the rectangular boundary. We present the first polynomial time constant ratio approximation algorithm for the MLC-R problem, which has been shown to be NP-hard [5].
متن کاملThe Minimum Guarding Tree Problem
Given a set L of non-parallel lines in the plane and a nonempty subset L′ ⊆ L, a guarding tree for L′ is a tree contained in the union of the lines in L such that if a mobile guard (agent) runs on the edges of the tree, all lines in L′ are visited by the guard. Similarly, given a connected arrangement S of line segments in the plane and a nonempty subset S ′ ⊆ S, we define a guarding tree for S...
متن کاملThe Complexity of Guarding Terrains
A set G of points on a 1.5-dimensional terrain, also known as an x-monotone polygonal chain, is said to guard the terrain if any point on the terrain is seen by a point in G. Two points on the terrain see each other if and only if the line segment between them is never strictly below the terrain. The minimum terrain guarding problem asks for a minimum guarding set for the given input terrain. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2012
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2012.06.003