<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-03880690</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-25T05:43:48+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Canadian Traveller Problem with Predictions</title>
            <author role="aut">
              <persName>
                <forename type="first">Evripidis</forename>
                <surname>Bampis</surname>
              </persName>
              <email type="md5">86302bba886873f656fe083cf63d42ea</email>
              <email type="domain">ibisc.univ-evry.fr</email>
              <idno type="idhal" notation="numeric">1284586</idno>
              <idno type="halauthorid" notation="string">145111-1284586</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-4498-3040</idno>
              <idno type="IDREF">https://www.idref.fr/095348743</idno>
              <idno type="VIAF">https://viaf.org/viaf/23268861</idno>
              <idno type="ISNI">http://isni.org/isni/0000000043124960</idno>
              <affiliation ref="#struct-541718"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Bruno</forename>
                <surname>Escoffier</surname>
              </persName>
              <email type="md5">45ad6b7432df4bb0628803bf27a7e2e3</email>
              <email type="domain">upmc.fr</email>
              <idno type="idhal" notation="string">brunoescoffier</idno>
              <idno type="idhal" notation="numeric">5124</idno>
              <idno type="halauthorid" notation="string">24013-5124</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-6477-8706</idno>
              <idno type="IDREF">https://www.idref.fr/067352421</idno>
              <idno type="ISNI">http://isni.org/isni/0000000358818668</idno>
              <idno type="VIAF">https://viaf.org/viaf/211089377</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/CPG-4773-2022</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/http://www.researcherid.com/rid/CPG-4773-2022</idno>
              <affiliation ref="#struct-541718"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Michalis</forename>
                <surname>Xefteris</surname>
              </persName>
              <email type="md5">15139ac724bb73902c9978b1f3a2840f</email>
              <email type="domain">lip6.fr</email>
              <idno type="idhal" notation="numeric">1197213</idno>
              <idno type="halauthorid" notation="string">2664175-1197213</idno>
              <idno type="ORCID">https://orcid.org/0009-0006-2894-3029</idno>
              <idno type="IDREF">https://www.idref.fr/284818240</idno>
              <affiliation ref="#struct-541718"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Bruno</forename>
                <surname>Escoffier</surname>
              </persName>
              <email type="md5">57cd6fde79854ecfd036c42474425d7f</email>
              <email type="domain">lip6.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2022-12-01 12:05:12</date>
              <date type="whenModified">2025-01-21 08:58:29</date>
              <date type="whenReleased">2022-12-01 12:05:12</date>
              <date type="whenProduced">2022-09-08</date>
              <ref type="externalLink" target="http://arxiv.org/pdf/2209.11100"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="1006588">
                <persName>
                  <forename>Bruno</forename>
                  <surname>Escoffier</surname>
                </persName>
                <email type="md5">57cd6fde79854ecfd036c42474425d7f</email>
                <email type="domain">lip6.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-03880690</idno>
            <idno type="halUri">https://hal.science/hal-03880690</idno>
            <idno type="halBibtex">bampis:hal-03880690</idno>
            <idno type="halRefHtml">&lt;i&gt;20th International Workshop on Approximation and Online Algorithms, WAOA 2022&lt;/i&gt;, Sep 2022, Potsdam, Germany. pp.116--133, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-031-18367-6_6"&gt;&amp;#x27E8;10.1007/978-3-031-18367-6_6&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">20th International Workshop on Approximation and Online Algorithms, WAOA 2022, Sep 2022, Potsdam, Germany. pp.116--133, &amp;#x27E8;10.1007/978-3-031-18367-6_6&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="LIP6" corresp="SORBONNE-UNIVERSITE">Laboratoire d'Informatique de Paris 6</idno>
            <idno type="stamp" n="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SORBONNE-UNIV" corresp="SORBONNE-UNIVERSITE">Sorbonne Université 01/01/2018</idno>
            <idno type="stamp" n="SU-SCIENCES" corresp="SORBONNE-UNIVERSITE">Faculté des Sciences de Sorbonne Université</idno>
            <idno type="stamp" n="SU-TI">Sorbonne Université - Texte Intégral</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
            <idno type="stamp" n="SUPRA_MATHS_INFO">Mathématiques + Informatique</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Canadian Traveller Problem with Predictions</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Evripidis</forename>
                    <surname>Bampis</surname>
                  </persName>
                  <email type="md5">86302bba886873f656fe083cf63d42ea</email>
                  <email type="domain">ibisc.univ-evry.fr</email>
                  <idno type="idhal" notation="numeric">1284586</idno>
                  <idno type="halauthorid" notation="string">145111-1284586</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-4498-3040</idno>
                  <idno type="IDREF">https://www.idref.fr/095348743</idno>
                  <idno type="VIAF">https://viaf.org/viaf/23268861</idno>
                  <idno type="ISNI">http://isni.org/isni/0000000043124960</idno>
                  <affiliation ref="#struct-541718"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Bruno</forename>
                    <surname>Escoffier</surname>
                  </persName>
                  <email type="md5">45ad6b7432df4bb0628803bf27a7e2e3</email>
                  <email type="domain">upmc.fr</email>
                  <idno type="idhal" notation="string">brunoescoffier</idno>
                  <idno type="idhal" notation="numeric">5124</idno>
                  <idno type="halauthorid" notation="string">24013-5124</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-6477-8706</idno>
                  <idno type="IDREF">https://www.idref.fr/067352421</idno>
                  <idno type="ISNI">http://isni.org/isni/0000000358818668</idno>
                  <idno type="VIAF">https://viaf.org/viaf/211089377</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/CPG-4773-2022</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/http://www.researcherid.com/rid/CPG-4773-2022</idno>
                  <affiliation ref="#struct-541718"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Michalis</forename>
                    <surname>Xefteris</surname>
                  </persName>
                  <email type="md5">15139ac724bb73902c9978b1f3a2840f</email>
                  <email type="domain">lip6.fr</email>
                  <idno type="idhal" notation="numeric">1197213</idno>
                  <idno type="halauthorid" notation="string">2664175-1197213</idno>
                  <idno type="ORCID">https://orcid.org/0009-0006-2894-3029</idno>
                  <idno type="IDREF">https://www.idref.fr/284818240</idno>
                  <affiliation ref="#struct-541718"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>20th International Workshop on Approximation and Online Algorithms, WAOA 2022</title>
                  <date type="start">2022-09-08</date>
                  <date type="end">2022-09-09</date>
                  <settlement>Potsdam</settlement>
                  <country key="DE">Germany</country>
                </meeting>
                <imprint>
                  <biblScope unit="serie">Lecture Notes in Computer Science</biblScope>
                  <biblScope unit="volume">13538</biblScope>
                  <biblScope unit="pp">116--133</biblScope>
                  <date type="datePub">2022-10-21</date>
                </imprint>
              </monogr>
              <idno type="arxiv">2209.11100</idno>
              <idno type="doi">10.1007/978-3-031-18367-6_6</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Learning augmented algorithm</term>
                <term xml:lang="en">Online algorithm</term>
                <term xml:lang="en">Canadian Traveller Problem</term>
              </keywords>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>In this work, we consider the k-Canadian Traveller Problem (k-CTP) under the learning-augmented framework proposed by Lykouris &amp; Vassilvitskii. k-CTP is a generalization of the shortest path problem, and involves a traveller who knows the entire graph in advance and wishes to find the shortest route from a source vertex s to a destination vertex t, but discovers online that some edges (up to k) are blocked once reaching them. A potentially imperfect predictor gives us the number and the locations of the blocked edges.We present a deterministic and a randomized online algorithm for the learning-augmented k-CTP that achieve a tradeoff between consistency (quality of the solution when the prediction is correct) and robustness (quality of the solution when there are errors in the prediction). Moreover, we prove a matching lower bound for the deterministic case establishing that the tradeoff between consistency and robustness is optimal, and show a lower bound for the randomized algorithm. Finally, we prove several deterministic and randomized lower bounds on the competitive ratio of k-CTP depending on the prediction error, and complement them, in most cases, with matching upper bounds.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-541718" status="VALID">
          <orgName>Recherche Opérationnelle</orgName>
          <orgName type="acronym">RO</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-541703" type="direct"/>
            <relation active="#struct-413221" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-541703" status="VALID">
          <idno type="IdRef">13558292X</idno>
          <idno type="RNSR">199712651U</idno>
          <idno type="ROR">https://ror.org/05krcen59</idno>
          <orgName>LIP6</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>4 Place JUSSIEU 75252 PARIS CEDEX 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lip6.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-413221" type="direct"/>
            <relation name="UMR7606" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-413221" status="VALID">
          <idno type="IdRef">221333754</idno>
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Sorbonne Université</orgName>
          <orgName type="acronym">SU</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>21 rue de l’École de médecine - 75006 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.sorbonne-universite.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>