Change search
ReferencesLink to record
Permanent link

Direct link
Complexity of Canadian traveler problem variants
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.
2013 (English)In: Theoretical Computer Science, ISSN 0304-3975, Vol. 487, 1-16 p.Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
2013. Vol. 487, 1-16 p.
Keyword [en]
Canadian traveler problem, Complexity of navigation under uncertainty, Stochastic shortest path with recourse, NP-hard, Polynomial-time, PSPACE-complete, Stochastic shortest paths, Polynomial approximation, Stochastic systems, Graph theory
National Category
Computer Science
URN: urn:nbn:se:kth:diva-134461DOI: 10.1016/j.tcs.2013.03.016ISI: 000319791300001ScopusID: 2-s2.0-84877577190OAI: diva2:669023

QC 20131202

Available from: 2013-12-02 Created: 2013-11-25 Last updated: 2013-12-02Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Wenner, Cenny
By organisation
Theoretical Computer Science, TCS
In the same journal
Theoretical Computer Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 30 hits
ReferencesLink to record
Permanent link

Direct link