Approximation and complexity of multi-target graph search and the Canadian traveler problem (Q1637225)
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: Approximation and complexity of multi-target graph search and the Canadian traveler problem |
scientific article; zbMATH DE number 6882157
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation and complexity of multi-target graph search and the Canadian traveler problem |
scientific article; zbMATH DE number 6882157 |
Statements
Approximation and complexity of multi-target graph search and the Canadian traveler problem (English)
0 references
7 June 2018
0 references
Canadian traveler problem
0 references
graph search problem
0 references
approximation algorithms
0 references
computational complexity
0 references
routing under uncertainty
0 references
0 references
0 references
0 references
0.8960866
0 references
0.8843534
0 references
0.87259936
0 references
0.8723582
0 references
0.86654407
0 references
0.8627182
0 references
0.86204267
0 references
0 references
