The following pages link to The zookeeper route problem (Q1193837):
Displaying 12 items.
- On finding a shortest isothetic path and its monotonicity inside a digital object (Q499711) (← links)
- A 2-approximation algorithm for the zookeeper's problem (Q845863) (← links)
- Finding shortest safari routes in simple polygons (Q1014417) (← links)
- An approximative solution to the Zookeeper's problem (Q1014446) (← links)
- Approximation algorithms for the watchman route and zookeeper's problems. (Q1427191) (← links)
- Shortest zookeeper's routes in simple polygons (Q1607077) (← links)
- An O\((n\log n)\) algorithm for the zoo-keeper's problem (Q1869741) (← links)
- Optimal placement of base stations in border surveillance using limited capacity drones (Q2079881) (← links)
- Shortest paths in simple polygons with polygon-meet constraints (Q2390305) (← links)
- Query-point visibility constrained shortest paths in simple polygons (Q2465622) (← links)
- A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints (Q2811488) (← links)
- Inspecting a Set of Strips Optimally (Q3183473) (← links)
