Complexity of Canadian traveler problem variants

Theoretical Computer Science

Volumn 487, Issue , 2013, Pages 1-16

  Fried, Dror ^a   Shimony, Solomon Eyal ^a   Benbassat, Amit ^a   Wenner, Cenny ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b STOCKHOLM UNIVERSITY   (Sweden)

Author keywords

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

Indexed keywords

CANADIAN TRAVELER PROBLEM; COMPLEXITY OF NAVIGATION UNDER UNCERTAINTY; NP-HARD; POLYNOMIAL-TIME; PSPACE-COMPLETE; STOCHASTIC SHORTEST PATHS;

POLYNOMIAL APPROXIMATION; STOCHASTIC SYSTEMS;

GRAPH THEORY;

EID: 84877577190     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2013.03.016     Document Type: Article

References (15)

1. C. H. Papadimitriou, and M. Yannakakis Shortest Paths Without a Map Theoret. Comput. Sci. 84 1 1991 127 150
2. A. Bar-Noy, and B. Schieber The Canadian Traveller Problem SODA 1991 261 270
3. E. Nikolova, and D. R. Karger Route planning under uncertainty: the Canadian traveller problem AAAI 2008 969 974
4. G. H. Polychronopoulos, and J. N. Tsitsiklis Stochastic shortest path problems with recourse Networks 27 2 1996 133 143
5. Y. Xu, M. Hu, B. Su, B. Zhu, and Z. Zhu The Canadian Traveller Problem and its competitive analysis J. Comb. Optim. 18 2 2009 195 205
6. S. Westphal A note on the k-Canadian Traveller Problem Inf. Process. Lett. 106 3 2008 87 89
7. P. Eyerich, T. Keller, M. Helmert, High-quality policies for the Canadian Traveler's Problem, in: Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), 2010.
8. Z. Bnaya, A. Felner, D. Fried, O. Maksin, S. E. Shimony, Repeated-Task Canadian Traveler Problem, in: Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011.
9. Z. Bnaya, A. Felner, and S. Shimony Canadian Traveler Problem with remote sensing IJCAI 2009 437 442
10. C. Wenner, Hardness results for the shortest path problem under partial observability, Diploma Thesis, Lund University, 2009.
11. S. Russel, and P. Norvig Artificial Intelligence: A Modern Approach 1994 Prentice Hall
12. M. Garey, and D. Johnson Computers and Intractability, Problem Number LO11 1979 W.H. Freeman
13. J. Pearl Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference 1988 Morgan Kaufmann San Mateo, CA
14. M. Garey, and D. Johnson Computers and Intractability, Problem Number GT1 1979 W.H. Freeman
15. D. Zarchy, Theoretical and experimental analysis of the canadian traveler problem, Master Thesis, Ben-Gurion University of the Negev, 2010.