Approximation algorithms for art gallery problems in polygons (Q968202)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5703776
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for art gallery problems in polygons |
scientific article; zbMATH DE number 5703776 |
Statements
Approximation algorithms for art gallery problems in polygons (English)
0 references
5 May 2010
0 references
approximation algorithms
0 references
computational geometry
0 references
art gallery problems
0 references
visibility polygons
0 references
minimum set cover
0 references
greedy algorithms
0 references
0 references
0.9020421504974364
0 references
0.896708071231842
0 references
0.8790960311889648
0 references
0.8772616386413574
0 references
0.8683294653892517
0 references
