Pages that link to "Item:Q2711329"

The following pages link to Approximating a shortest watchman route (Q2711329):

Displaying 13 items.

• Shortest watchman routes in simple polygons (Q751818) (← links)
• Optimum watchman routes (Q1107312) (← 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)
• Finding the shortest watchman route in a simple polygon (Q1807612) (← links)
• A linear-time 2-approximation algorithm for the watchman route problem for simple polygons (Q2382287) (← links)
• GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST (Q3562851) (← 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)
• Approximating Watchman Routes (Q5741768) (← links)
• Computational Science and Its Applications – ICCSA 2004 (Q5901277) (← links)
• Approximation algorithms for the two-watchman route in a simple polygon (Q6614109) (← links)