Complexity of Canadian traveler problem variants.

Dror Fried,Solomon Eyal Shimony,Amit Benbassat,Cenny Wenner

Theoretical Computer Science（2013）

引用 37|浏览48

暂无评分

摘要

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.

查看译文

关键词

Canadian traveler problem,Complexity of navigation under uncertainty,Stochastic shortest path with recourse

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要