Technical Note—The Complexity of the Optimal Searcher Path Problem (Q4724426)
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 3997550
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Technical Note—The Complexity of the Optimal Searcher Path Problem |
scientific article; zbMATH DE number 3997550 |
Statements
Technical Note—The Complexity of the Optimal Searcher Path Problem (English)
0 references
1986
0 references
search path
0 references
complexity
0 references
stationary target
0 references
NP-complete
0 references
NP-hard
0 references
0.7478879690170288
0 references
0.7410168051719666
0 references
0.7357172966003418
0 references
0.7326906323432922
0 references
0.7319133877754211
0 references
