Computational complexity of the \(r\)-visibility guard set problem for polyominoes (Q2945667)
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 6481890
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of the \(r\)-visibility guard set problem for polyominoes |
scientific article; zbMATH DE number 6481890 |
Statements
Computational Complexity of the $$r$$-visibility Guard Set Problem for Polyominoes (English)
0 references
14 September 2015
0 references
art gallery problem
0 references
polyomino
0 references
\(r\)-visibility
0 references
NP-hardness
0 references
0.8789321780204773
0 references
0.863791286945343
0 references
0.837503969669342
0 references
0.8341081142425537
0 references
