Optimum watchman routes
From MaRDI portal
Publication:1107312
DOI10.1016/0020-0190(88)90141-XzbMath0652.68042MaRDI QIDQ1107312
Wei-Pang Chin, Simeon C. Ntafos
Publication date: 1988
Published in: Information Processing Letters (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99)
Related Items
Minimal link visibility paths inside a simple polygon, Competitive exploration of rectilinear polygons, Approximate guarding of monotone and rectilinear polygons, Concerning the time bounds of existing shortest watchman route algorithms, Computing a shortest watchman path in a simple polygon in polynomial-time, A linear-time 2-approximation algorithm for the watchman route problem for simple polygons, Inspecting a Set of Strips Optimally, An Improved On-line Strategy for Exploring Unknown Polygons, An algorithmic approach to some problems in terrain navigation, The touring rays and related problems, Improved exploration of unknown polygons, Visibility-based pursuit-evasion in a polygonal environment, An improved algorithm for computing a shortest watchman route for lines, Optimality and competitiveness of exploring polygons by mobile robots, Perpetual maintenance of machines with different urgency requirements, \(k\)-Transmitter watchman routes, Watchman tours for polygons with holes, Observation routes and external watchman routes, The robber route problem, Minimum covering with travel cost, Complexity of minimum corridor guarding problems, Watchman routes for lines and line segments, Approximation algorithms for the watchman route and zookeeper's problems., Online algorithms for searching and exploration in the plane, Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems, Finding a shortest Hamiltonian path inside a simple polygon, Watchman routes under limited visibility, GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST, The zookeeper route problem, A competitive analysis of algorithms for searching unknown scenes, Approximating the tree and tour covers of a graph, Information-seeking control under visibility-based uncertainty, Path optimization with limited sensing ability, Polynomial-time algorithms for the touring rays and related problems, Minimum-link watchman tours, Finding shortest safari routes in simple polygons, Shortest watchman routes in simple polygons, Shortest polygonal paths in space, Polygon exploration with time-discrete vision, Watchman routes in the presence of a pair of convex polygons, On Romeo and Juliet problems: minimizing distance-to-sight, On Romeo and Juliet Problems: Minimizing Distance-to-Sight., How to Keep an Eye on Small Things, Fast computation of shortest watchman routes in simple polygons
Cites Work
