Abstract
The Canadian Traveller Problem is a PSPACE-complete optimization problem where a traveller traverses an undirected weighted graph G from source s to target t where some edges \(E_*\) are blocked. At the beginning, the traveller does not know which edges are blocked. He discovers them when arriving at one of their endpoints. The objective is to minimize the distance traversed to reach t.
Westphal proved that no randomized strategy has a competitive ratio smaller than \(\left| E_* \right| +1\). We show, using linear algebra techniques, that this bound cannot be attained, especially on a specific class of graphs: apex trees. Indeed, no randomized strategy can be \(\left( \left| E_* \right| +1\right) \)-competitive, even on apex trees with only three simple \((s,t)\)-paths.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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)
Bergé, P., Hemery, J., Rimmel, A., Tomasik, J.: On the competitiveness of memoryless strategies for the k-Canadian Traveller Problem. Inform. Proces. Lett. (submitted)
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, New York, USA (1998)
Demaine, E.D., Huang, Y., Liao, C.-S., Sadakane, K.: Canadians should travel randomly. In: Proceedings of ICALP, pp. 380–391 (2014)
Farkas, J.: Uber die Theorie der Einfachen Ungleichungen. J. fur die Reine und Angewandte Math. 124, 1–27 (1902)
Matousek, J., Gärtner, B.: Understanding and Using Linear Programming. Springer, New York, USA (2006)
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)
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). The Competitiveness of Randomized Strategies for Canadians via Systems of Linear Inequalities. In: Czachórski, T., Gelenbe, E., Grochla, K., Lent, R. (eds) Computer and Information Sciences. ISCIS 2018. Communications in Computer and Information Science, vol 935. Springer, Cham. https://doi.org/10.1007/978-3-030-00840-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-030-00840-6_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00839-0
Online ISBN: 978-3-030-00840-6
eBook Packages: Computer ScienceComputer Science (R0)