Optimum watchman routes
From MaRDI portal
Publication:1107312
DOI10.1016/0020-0190(88)90141-XzbMATH Open0652.68042MaRDI QIDQ1107312FDOQ1107312
Authors: Wei-Pang Chin, Simeon C. Ntafos 
Publication date: 1988
Published in: Information Processing Letters (Search for Journal in Brave)
Recommendations
- Approximating watchman routes
- Approximating a shortest watchman route
- Watchman routes for lines and segments
- Watchman routes under limited visibility
- Optimal routing with failure-independent path protection
- Optimal Node Routing
- Watchman routes in the presence of a pair of convex polygons
- Watchman routes for lines and line segments
- AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES
Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25)
Cites Work
Cited In (52)
- Observation routes and external watchman routes
- Approximation algorithms for the two-watchman route in a simple polygon
- Observation routes and external watchman routes
- A competitive analysis of algorithms for searching unknown scenes
- An improved algorithm for computing a shortest watchman route for lines
- On Romeo and Juliet problems: minimizing distance-to-sight
- On Romeo and Juliet problems: minimizing distance-to-sight
- Title not available (Why is that?)
- Title not available (Why is that?)
- Watchman routes under limited visibility
- An algorithmic approach to some problems in terrain navigation
- Watchman routes in the presence of a pair of convex polygons
- Title not available (Why is that?)
- Watchman routes for lines and segments
- Minimum-link watchman tours
- Minimal link visibility paths inside a simple polygon
- Approximating watchman routes
- Watchman tours for polygons with holes
- Path optimization with limited sensing ability
- Concerning the time bounds of existing shortest watchman route algorithms
- Computing a shortest watchman path in a simple polygon in polynomial-time
- Information-seeking control under visibility-based uncertainty
- Visibility-based pursuit-evasion in a polygonal environment
- Minimum covering with travel cost
- Fast computation of shortest watchman routes in simple polygons
- How to Keep an Eye on Small Things
- Shortest watchman routes in simple polygons
- Approximate guarding of monotone and rectilinear polygons
- Watchman routes for lines and line segments
- Complexity of minimum corridor guarding problems
- Optimality and competitiveness of exploring polygons by mobile robots
- Approximating the tree and tour covers of a graph
- Polygon exploration with time-discrete vision
- Online algorithms for searching and exploration in the plane
- The touring rays and related problems
- Shortest polygonal paths in space
- Perpetual maintenance of machines with different urgency requirements
- Efficient algorithms for touring a sequence of convex polygons and related problems
- \(k\)-Transmitter watchman routes
- The robber route problem
- Approximation algorithms for the watchman route and zookeeper's problems.
- Polynomial-time algorithms for the touring rays and related problems
- Inspecting a Set of Strips Optimally
- GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST
- An improved on-line strategy for exploring unknown polygons
- A linear-time 2-approximation algorithm for the watchman route problem for simple polygons
- Solving the Watchman Route Problem with Heuristic Search
- Finding shortest safari routes in simple polygons
- Finding a shortest Hamiltonian path inside a simple polygon
- The zookeeper route problem
- Competitive exploration of rectilinear polygons
- Improved exploration of unknown polygons
This page was built for publication: Optimum watchman routes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107312)
