The following pages link to Optimum watchman routes (Q1107312):
Displaying 37 items.
- Watchman tours for polygons with holes (Q419503) (← links)
- Minimum covering with travel cost (Q454247) (← links)
- Complexity of minimum corridor guarding problems (Q456091) (← links)
- Online algorithms for searching and exploration in the plane (Q465662) (← links)
- Optimality and competitiveness of exploring polygons by mobile robots (Q617716) (← links)
- Finding a shortest Hamiltonian path inside a simple polygon (Q671605) (← links)
- A competitive analysis of algorithms for searching unknown scenes (Q685600) (← links)
- Approximating the tree and tour covers of a graph (Q688437) (← links)
- Path optimization with limited sensing ability (Q729301) (← links)
- Shortest watchman routes in simple polygons (Q751818) (← links)
- Shortest polygonal paths in space (Q756442) (← links)
- The robber route problem (Q909464) (← links)
- Minimum-link watchman tours (Q1007602) (← links)
- Finding shortest safari routes in simple polygons (Q1014417) (← links)
- Polygon exploration with time-discrete vision (Q1037781) (← links)
- An algorithmic approach to some problems in terrain navigation (Q1116366) (← links)
- Watchman routes under limited visibility (Q1188285) (← links)
- The zookeeper route problem (Q1193837) (← links)
- Watchman routes in the presence of a pair of convex polygons (Q1291565) (← links)
- Approximation algorithms for the watchman route and zookeeper's problems. (Q1427191) (← links)
- Fast computation of shortest watchman routes in simple polygons (Q1607078) (← links)
- An improved algorithm for computing a shortest watchman route for lines (Q1685027) (← links)
- Polynomial-time algorithms for the touring rays and related problems (Q2039639) (← links)
- Information-seeking control under visibility-based uncertainty (Q2251228) (← links)
- On Romeo and Juliet problems: minimizing distance-to-sight (Q2331220) (← links)
- Minimal link visibility paths inside a simple polygon (Q2367125) (← links)
- Competitive exploration of rectilinear polygons (Q2368973) (← links)
- Approximate guarding of monotone and rectilinear polygons (Q2375947) (← links)
- A linear-time 2-approximation algorithm for the watchman route problem for simple polygons (Q2382287) (← links)
- Watchman routes for lines and line segments (Q2445196) (← links)
- The touring rays and related problems (Q2662682) (← links)
- Improved exploration of unknown polygons (Q2672604) (← links)
- Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems (Q2988854) (← links)
- Inspecting a Set of Strips Optimally (Q3183473) (← links)
- Concerning the time bounds of existing shortest watchman route algorithms (Q5055936) (← links)
- On Romeo and Juliet Problems: Minimizing Distance-to-Sight. (Q5116469) (← links)
- Perpetual maintenance of machines with different urgency requirements (Q6078292) (← links)
