An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries (Q2340409)
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: An O( OPT)-approximation algorithm for multi-guarding galleries |
scientific article; zbMATH DE number 6426246
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries |
scientific article; zbMATH DE number 6426246 |
Statements
An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries (English)
0 references
16 April 2015
0 references
art gallery problem
0 references
polygon guarding
0 references
approximation algorithm
0 references
epsilon-net
0 references
0.8731520175933838
0 references
0.8640950322151184
0 references
0.8485120534896851
0 references
0.8423182964324951
0 references
0.8384199738502502
0 references
