Journal
THEORETICAL COMPUTER SCIENCE
Volume 487, Issue -, Pages 1-16Publisher
ELSEVIER
DOI: 10.1016/j.tcs.2013.03.016
Keywords
Canadian traveler problem; Complexity of navigation under uncertainty; Stochastic shortest path with recourse
Categories
Funding
- Israel Science Foundation [305/09]
- Lynn and William Frankel Center for Computer Sciences
- ERC [226203]
Ask authors/readers for more resources
The Canadian traveler problem (CTP) is the problem of traversing a given graph, where some of the edges may be blocked a state which is revealed only upon reaching an incident vertex. Originally stated by Papadimitriou and Yannakakis (1991) [1], the adversarial version of the CTP was shown to be PSPACE-complete, with the stochastic version shown to be in PSPACE and #P-hard. We show that the stochastic CTP is also PSPACE-complete: initially proving PSPACE-hardness for the dependent version of the stochastic CTP, and proceeding with gadgets that allow us to extend the proof to the independent case. Since for disjoint-path graphs, the CTP can be solved in polynomial time, we examine the complexity of the more general remote-sensing CTP, and show that it is NP-hard even for disjoint-path graphs. (C) 2013 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available