Approximation algorithms for the two-watchman route in a simple polygon (Q6614109)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximation algorithms for the two-watchman route in a simple polygon |
scientific article; zbMATH DE number 7921938
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for the two-watchman route in a simple polygon |
scientific article; zbMATH DE number 7921938 |
Statements
Approximation algorithms for the two-watchman route in a simple polygon (English)
0 references
7 October 2024
0 references
art gallery problems
0 references
visibility
0 references
watchman routes
0 references
approximation algorithms
0 references
0 references
0 references
