Abstract
The k-Canadian Traveller Problem (\(k\)-CTP), proven PSPACE-complete by Papadimitriou and Yannakakis, is a generalization of the Shortest Path Problem which admits blocked edges. Its objective is to determine the strategy that makes the traveller traverse graph G between two given nodes s and t with the minimal distance, knowing that at most k edges are blocked. The traveller discovers that an edge is blocked when arriving at one of its endpoints.
We study the competitiveness of randomized memoryless strategies to solve the \(k\)-CTP. Memoryless strategies are attractive in practice as a decision made by the strategy for a traveller in node v of G does not depend on his anterior moves. We establish that the competitive ratio of any randomized memoryless strategy cannot be better than \(2k + O\left( 1\right) \). This means that randomized memoryless strategies are asymptotically as competitive as deterministic strategies which achieve a ratio \(2k+1\) at best.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Albers, S.: Online algorithms: a survey. Math. Program. 97, 3–26 (2003)
Bar-Noy, A., Schieber, B.: The Canadian traveller problem. In: Proceedings of ACM/SIAM SODA, pp. 261–270 (1991)
Bender, M., Westphal, S.: An optimal randomized online algorithm for the k-Canadian traveller problem on node-disjoint paths. J. Comb. Optim. 30(1), 87–96 (2015)
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Demaine, E.D., Huang, Y., Liao, C.-S., Sadakane, K.: Canadians should travel randomly. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 380–391. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-43948-7_32
Papadimitriou, C., Yannakakis, M.: Shortest paths without a map. Theor. Comput. Sci. 84(1), 127–150 (1991)
Westphal, S.: A note on the k-Canadian traveller problem. Inform. Proces. Lett. 106(3), 87–89 (2008)
Xu, Y., Hu, M., Su, B., Zhu, B., Zhu, Z.: The Canadian traveller problem and its competitive analysis. J. Comb. Optim. 18(2), 195–205 (2009)
Yao, A.C.: Probabilistic computations: toward a unified measure of complexity. In: Proceedings of FOCS, pp. 222–227 (1977)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Bergé, P., Hemery, J., Rimmel, A., Tomasik, J. (2018). On the Competitiveness of Memoryless Strategies for the k-Canadian Traveller Problem. In: Kim, D., Uma, R., Zelikovsky, A. (eds) Combinatorial Optimization and Applications. COCOA 2018. Lecture Notes in Computer Science(), vol 11346. Springer, Cham. https://doi.org/10.1007/978-3-030-04651-4_38
Download citation
DOI: https://doi.org/10.1007/978-3-030-04651-4_38
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-04650-7
Online ISBN: 978-3-030-04651-4
eBook Packages: Computer ScienceComputer Science (R0)