Approximation and complexity of multi-target graph search and the Canadian traveler problem (Q1637225)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation and complexity of multi-target graph search and the Canadian traveler problem |
scientific article |
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
