Computational complexity of the chromatic art gallery problem for orthogonal polygons (Q782174)
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 7224280
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of the chromatic art gallery problem for orthogonal polygons |
scientific article; zbMATH DE number 7224280 |
Statements
Computational complexity of the chromatic art gallery problem for orthogonal polygons (English)
0 references
22 July 2020
0 references
chromatic art gallery problem
0 references
orthogonal polygons
0 references
\(r\)-visibility
0 references
NP-hard
0 references
0.8413098454475403
0 references
0.8351022601127625
0 references
0.8112218379974365
0 references
0.7980162501335144
0 references
0.7937825918197632
0 references
