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...
保存先:
| 主要な著者: | , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
Wolfgang Mulzer
2025-08-01
|
| シリーズ: | Computing in Geometry and Topology |
| オンライン･アクセス: | https://www.cgt-journal.org/index.php/cgt/article/view/71 |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|