Pages that link to "Item:Q1607078"
From MaRDI portal
The following pages link to Fast computation of shortest watchman routes in simple polygons (Q1607078):
Displayed 12 items.
- Watchman tours for polygons with holes (Q419503) (← links)
- Complexity of minimum corridor guarding problems (Q456091) (← links)
- A 2-approximation algorithm for the zookeeper's problem (Q845863) (← 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)
- An improved algorithm for computing a shortest watchman route for lines (Q1685027) (← 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)
- Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems (Q2988854) (← links)
- Open Guard Edges and Edge Guards in Simple Polygons (Q4899264) (← links)
- THE TRAVELING SALESMAN PROBLEM FOR LINES AND RAYS IN THE PLANE (Q4903631) (← links)