[HTML][HTML] Approximation and complexity of multi-target graph search and the Canadian traveler problem
M van Ee, R Sitters - Theoretical Computer Science, 2018 - Elsevier
In the Canadian traveler problem, we are given an edge weighted graph with two specified
vertices s and t and a probability distribution over the edges that tells which edges are …
vertices s and t and a probability distribution over the edges that tells which edges are …
[PDF][PDF] Routing under uncertainty: approximation and complexity
M van Ee - 2017 - research.vu.nl
This thesis covers part of the research I performed during my appointment as Ph. D.
candidate. All the chapters in this thesis concern routing problems that deal with some sort of …
candidate. All the chapters in this thesis concern routing problems that deal with some sort of …