A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems (Q3603524): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56504465, #quickstatements; #temporary_batch_1706339005099 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:59, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems |
scientific article |
Statements
A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems (English)
0 references
17 February 2009
0 references
