Pages that link to "Item:Q1427191"
From MaRDI portal
The following pages link to Approximation algorithms for the watchman route and zookeeper's problems. (Q1427191):
Displaying 16 items.
- Complexity of minimum corridor guarding problems (Q456091) (← links)
- On finding a shortest isothetic path and its monotonicity inside a digital object (Q499711) (← links)
- Approximating the metric TSP in linear time (Q649110) (← links)
- Finding an approximate minimum-link visibility path inside a simple polygon (Q672401) (← links)
- Shortest watchman routes in simple polygons (Q751818) (← links)
- A 2-approximation algorithm for the zookeeper's problem (Q845863) (← links)
- An approximative solution to the Zookeeper's problem (Q1014446) (← links)
- Watchman routes under limited visibility (Q1188285) (← links)
- The zookeeper route problem (Q1193837) (← links)
- A linear-time 2-approximation algorithm for the watchman route problem for simple polygons (Q2382287) (← links)
- Shortest paths in simple polygons with polygon-meet constraints (Q2390305) (← links)
- Query-point visibility constrained shortest paths in simple polygons (Q2465622) (← links)
- Improved exploration of unknown polygons (Q2672604) (← links)
- An Improved On-line Strategy for Exploring Unknown Polygons (Q3467843) (← links)
- Approximating the Metric TSP in Linear Time (Q5302042) (← links)
- Approximating Watchman Routes (Q5741768) (← links)
