Pages that link to "Item:Q1685027"
From MaRDI portal
The following pages link to An improved algorithm for computing a shortest watchman route for lines (Q1685027):
Displaying 5 items.
- Fast computation of shortest watchman routes in simple polygons (Q1607078) (← links)
- Graphs with equal domination and covering numbers (Q2292127) (← links)
- Watchman routes for lines and line segments (Q2445196) (← links)
- Approximating a shortest watchman route (Q2711329) (← links)
- Concerning the time bounds of existing shortest watchman route algorithms (Q5055936) (← links)