Pages that link to "Item:Q4949994"

The following pages link to CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES" (Q4949994):

Displaying 22 items.

• Complexity of minimum corridor guarding problems (Q456091) (← links)
• Minimum-link watchman tours (Q1007602) (← links)
• Finding shortest safari routes in simple polygons (Q1014417) (← links)
• Polygon exploration with time-discrete vision (Q1037781) (← links)
• Approximation algorithms for the watchman route and zookeeper's problems. (Q1427191) (← links)
• The traveling salesmanpProblem for lines in the plane (Q1603540) (← 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)
• Corrigendum to ``Improving the computational efficiency of metric-based spares algorithms'' (Q1926902) (← links)
• Optimal placement of base stations in border surveillance using limited capacity drones (Q2079881) (← 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)
• Online searching with an autonomous robot (Q2489019) (← 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)
• An Improved On-line Strategy for Exploring Unknown Polygons (Q3467843) (← links)
• THE TRAVELING SALESMAN PROBLEM FOR LINES AND RAYS IN THE PLANE (Q4903631) (← links)
• Concerning the time bounds of existing shortest watchman route algorithms (Q5055936) (← links)
• Computing a shortest watchman path in a simple polygon in polynomial-time (Q5057427) (← links)
• Approximation algorithms for the two-watchman route in a simple polygon (Q6614109) (← links)
• Observation routes and external watchman routes (Q6633574) (← links)