2026-07-21T14:10:58Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:18587 2024-03-06T11:02:11Z ddc:004 open_access

The Covering Canadian Traveller Problem Revisited Hahn, Niklas Xefteris, Michalis Online Algorithm Canadian Traveller Problem Travelling Salesperson Problem Graph Exploration In this paper, we consider the k-Covering Canadian Traveller Problem (k-CCTP), which can be seen as a variant of the Travelling Salesperson Problem. The goal of k-CCTP is finding the shortest tour for a traveller to visit a set of locations in a given graph and return to the origin. Crucially, unknown to the traveller, up to k edges of the graph are blocked and the traveller only discovers blocked edges online at one of their respective endpoints. The currently best known upper bound for k-CCTP is O(√k) which was shown in [Huang and Liao, ISAAC '12]. We improve this polynomial bound to a logarithmic one by presenting a deterministic O(log k)-competitive algorithm that runs in polynomial time. Further, we demonstrate the tightness of our analysis by giving a lower bound instance for our algorithm. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Niklas Hahn and Michalis Xefteris 2023 Is Part Of LIPIcs, Volume 272, 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.MFCS.2023.53 urn:nbn:de:0030-drops-185876 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.53 eng https://creativecommons.org/licenses/by/4.0/legalcode