Pages that link to "Item:Q5055936"
From MaRDI portal
The following pages link to Concerning the time bounds of existing shortest watchman route algorithms (Q5055936):
Displaying 8 items.
- Complexity of minimum corridor guarding problems (Q456091) (← links)
- Minimum-link watchman tours (Q1007602) (← links)
- Finding shortest safari routes in simple polygons (Q1014417) (← 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)
- Approximating a shortest watchman route (Q2711329) (← links)
- Approximation algorithms for the two-watchman route in a simple polygon (Q6614109) (← links)