Complexity of minimum corridor guarding problems (Q456091)
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: Complexity of minimum corridor guarding problems |
scientific article; zbMATH DE number 6098068
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of minimum corridor guarding problems |
scientific article; zbMATH DE number 6098068 |
Statements
Complexity of minimum corridor guarding problems (English)
0 references
23 October 2012
0 references
computational complexity
0 references
computational geometry
0 references
corridor guarding
0 references
NP-complete
0 references
0 references
0.8359472155570984
0 references
0.8052696585655212
0 references
0.7958371043205261
0 references
0.781304657459259
0 references
0.7809392809867859
0 references
