Finding minimum hidden guard sets in polygons --- tight approximability results (Q2489014)
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: Finding minimum hidden guard sets in polygons --- tight approximability results |
scientific article; zbMATH DE number 5023331
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding minimum hidden guard sets in polygons --- tight approximability results |
scientific article; zbMATH DE number 5023331 |
Statements
Finding minimum hidden guard sets in polygons --- tight approximability results (English)
0 references
16 May 2006
0 references
minimum Hidden guard set
0 references
inapproximability
0 references
approximation algorithm
0 references
visibility
0 references
art gallery problems
0 references
terrains
0 references
polygons
0 references
0 references
0.8653255701065063
0 references
0.8653255701065063
0 references
0.8634524345397949
0 references
0.8611323237419128
0 references
