Approximation Algorithms for Anchored Multiwatchman Routes
We study some variants of the k-Watchman Routes problem, the cooperative version of the classic Watchman Route problem in a simple polygon. The k watchmen may be required to see the whole polygon, or some pre-determined quota of area within the polygon, and we want to minimize the maximum length tr...
Na minha lista:
| Principais autores: | , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Wolfgang Mulzer
2025-08-01
|
| Serier: | Computing in Geometry and Topology |
| Online adgang: | https://www.cgt-journal.org/index.php/cgt/article/view/71 |
| Tags: |
Ingen Tags, Vær først til at tagge denne postø!
|