Pages that link to "Item:Q2382287"
From MaRDI portal
The following pages link to A linear-time 2-approximation algorithm for the watchman route problem for simple polygons (Q2382287):
Displaying 13 items.
- Touring a sequence of disjoint polygons: complexity and extension (Q300225) (← links)
- Complexity of minimum corridor guarding problems (Q456091) (← 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)
- Shortest watchman tours in simple polygons under rotated monotone visibility (Q2019474) (← links)
- Watchman routes for lines and line segments (Q2445196) (← links)
- Improved exploration of unknown polygons (Q2672604) (← links)
- GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST (Q3562851) (← links)
- The Two-Guard Polygon Walk Problem (Q3630230) (← links)
- Approximation algorithms for the two-watchman route in a simple polygon (Q6614109) (← links)
- Observation routes and external watchman routes (Q6633574) (← links)
