The following pages link to Approximating Watchman Routes (Q5741768):
Displaying 18 items.
- Watchman tours for polygons with holes (Q419503) (← links)
- Minimum covering with travel cost (Q454247) (← links)
- Finding an approximate minimum-link visibility path inside a simple polygon (Q672401) (← links)
- Minimum-link watchman tours (Q1007602) (← links)
- Optimum watchman routes (Q1107312) (← links)
- Watchman routes under limited visibility (Q1188285) (← links)
- Watchman routes in the presence of a pair of convex polygons (Q1291565) (← links)
- On Romeo and Juliet problems: minimizing distance-to-sight (Q2331220) (← links)
- Watchman routes for lines and line segments (Q2445196) (← links)
- Approximating a shortest watchman route (Q2711329) (← links)
- Gender-aware facility location in multi-gender world (Q3301019) (← links)
- GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST (Q3562851) (← links)
- How to Keep an Eye on Small Things (Q5012868) (← links)
- On Romeo and Juliet Problems: Minimizing Distance-to-Sight. (Q5116469) (← links)
- Solving the Watchman Route Problem with Heuristic Search (Q5870496) (← links)
- Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles (Q6174144) (← links)
- Approximation algorithms for the two-watchman route in a simple polygon (Q6614109) (← links)
- Observation routes and external watchman routes (Q6633574) (← links)
