A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems (Q3603524)
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: A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems |
scientific article; zbMATH DE number 5508797
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems |
scientific article; zbMATH DE number 5508797 |
Statements
A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems (English)
0 references
17 February 2009
0 references
0.8885233998298645
0 references
0.8790960311889648
0 references
0.8485120534896851
0 references
0.8429440855979919
0 references
0.8401730060577393
0 references
