Information Processing Letters
Shortest watchman routes in simple polygons
Discrete & Computational Geometry
Approximating the tree and tour covers of a graph
Information Processing Letters
Approximation algorithms for geometric tour and network design problems (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Provably good routing tree construction with multi-port terminals
Proceedings of the 1997 international symposium on Physical design
A better heuristic for orthogonal graph drawings
Computational Geometry: Theory and Applications
A polylogarithmic approximation algorithm for the group Steiner tree problem
Journal of Algorithms
Fast computation of shortest watchman routes in simple polygons
Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Constructing Shortest Watchman Routes by Divide-and-Conquer
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Approximation Algorithms for the Watchman Route and Zookeeper's Problems
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Beyond Steiner's Problem: A VLSI Oriented Generalization
WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
The Complexity of Approximating the Class Steiner Tree Problem
WG '91 Proceedings of the 17th International Workshop
Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
Touring a sequence of polygons
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Approximation algorithms for the watchman route and zookeeper's problems
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Complexity of the minimum-length corridor problem
Computational Geometry: Theory and Applications
On the minimum corridor connection problem and other generalized geometric problems
Computational Geometry: Theory and Applications
Approximating corridors and tours via restriction and relaxation techniques
ACM Transactions on Algorithms (TALG)
Watchman routes for lines and line segments
Computational Geometry: Theory and Applications
| Hi-index | 0.89 |
In this paper, the complexity of minimum corridor guarding problems is discussed. These problems 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 walk with minimum total length along edges of the arrangement, such that if the guard runs on the tree or on the closed walk, all line segments are visited by the guard. These problems are proved to be NP-complete.