<?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-02022459</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-06T13:36:29+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">On the competitiveness of memoryless strategies for the $k$-Canadian Traveller Problem</title>
            <author role="aut">
              <persName>
                <forename type="first">Pierre</forename>
                <surname>Bergé</surname>
              </persName>
              <email type="md5">d1f34daacc77a7aec2496eb6623396e7</email>
              <email type="domain">lri.fr</email>
              <idno type="idhal" notation="string">pierre-berge</idno>
              <idno type="idhal" notation="numeric">1161158</idno>
              <idno type="halauthorid" notation="string">256478-1161158</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-6170-9473</idno>
              <idno type="IDREF">https://www.idref.fr/241813964</idno>
              <affiliation ref="#struct-399697"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Julien</forename>
                <surname>Hemery</surname>
              </persName>
              <email type="md5">f2928406fbb8b364ba87ea9cf754398c</email>
              <email type="domain">supelec.fr</email>
              <idno type="idhal" notation="numeric">1037486</idno>
              <idno type="halauthorid" notation="string">1438247-1037486</idno>
              <affiliation ref="#struct-2544"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Arpad</forename>
                <surname>Rimmel</surname>
              </persName>
              <email type="md5">e682007e97ebc320e25ce8f5e4b634be</email>
              <email type="domain">lri.fr</email>
              <idno type="idhal" notation="string">arpad-rimmel</idno>
              <idno type="idhal" notation="numeric">18807</idno>
              <idno type="halauthorid" notation="string">6921-18807</idno>
              <idno type="IDREF">https://www.idref.fr/140527273</idno>
              <idno type="ORCID">https://orcid.org/0009-0009-7028-3644</idno>
              <idno type="ISNI">http://isni.org/isni/0000000139853068</idno>
              <idno type="VIAF">https://viaf.org/viaf/187622533</idno>
              <affiliation ref="#struct-2544"/>
              <affiliation ref="#struct-399697"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Joanna</forename>
                <surname>Tomasik</surname>
              </persName>
              <email type="md5">42bb1c984527a10e6bff430a20975060</email>
              <email type="domain">centralesupelec.fr</email>
              <idno type="idhal" notation="string">joanna-tomasik</idno>
              <idno type="idhal" notation="numeric">15160</idno>
              <idno type="halauthorid" notation="string">29497-15160</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-5560-2821</idno>
              <idno type="IDREF">https://www.idref.fr/157880559</idno>
              <affiliation ref="#struct-399697"/>
              <affiliation ref="#struct-411575"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Joanna</forename>
                <surname>Tomasik</surname>
              </persName>
              <email type="md5">bae460fc9ceaba80233697806a906aec</email>
              <email type="domain">lisn.upsaclay.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2019-02-17 22:53:36</date>
              <date type="whenModified">2026-01-12 10:42:14</date>
              <date type="whenReleased">2019-02-17 22:53:36</date>
              <date type="whenProduced">2018-12-15</date>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="335979">
                <persName>
                  <forename>Joanna</forename>
                  <surname>Tomasik</surname>
                </persName>
                <email type="md5">bae460fc9ceaba80233697806a906aec</email>
                <email type="domain">lisn.upsaclay.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-02022459</idno>
            <idno type="halUri">https://hal.science/hal-02022459</idno>
            <idno type="halBibtex">berge:hal-02022459</idno>
            <idno type="halRefHtml">&lt;i&gt;International Conference Combinatorial Optimization and Applications (COCOA)&lt;/i&gt;, Dec 2018, Atlanta, United States. pp.566-576, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-030-04651-4_38"&gt;&amp;#x27E8;10.1007/978-3-030-04651-4_38&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">International Conference Combinatorial Optimization and Applications (COCOA), Dec 2018, Atlanta, United States. pp.566-576, &amp;#x27E8;10.1007/978-3-030-04651-4_38&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="UNIV-PSUD">Université Paris Sud - Paris XI</idno>
            <idno type="stamp" n="UMR8623">Laboratoire de Recherche en Informatique</idno>
            <idno type="stamp" n="CENTRALESUPELEC">Ecole CentraleSupélec</idno>
            <idno type="stamp" n="LRI-GALAC" corresp="UMR8623">Equipe : Graphes, Algorithmes et Combinatoire</idno>
            <idno type="stamp" n="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="UNIV-PSUD-SACLAY" corresp="UNIV-PARIS-SACLAY">Université Paris Sud pour Paris Saclay</idno>
            <idno type="stamp" n="CENTRALESUPELEC-SACLAY" corresp="UNIV-PARIS-SACLAY">CENTRALESUPELEC-SACLAY</idno>
            <idno type="stamp" n="LISN">Laboratoire Interdisciplinaire des Sciences du Numérique</idno>
            <idno type="stamp" n="GS-ENGINEERING">Graduate School Sciences de l'Ingénierie et des Systèmes</idno>
            <idno type="stamp" n="GS-COMPUTER-SCIENCE">Graduate School Computer Science</idno>
            <idno type="stamp" n="LISN-GALAC" corresp="LISN">Graphes, Algorithmes et Combinatoire </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">On the competitiveness of memoryless strategies for the $k$-Canadian Traveller Problem</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Pierre</forename>
                    <surname>Bergé</surname>
                  </persName>
                  <email type="md5">d1f34daacc77a7aec2496eb6623396e7</email>
                  <email type="domain">lri.fr</email>
                  <idno type="idhal" notation="string">pierre-berge</idno>
                  <idno type="idhal" notation="numeric">1161158</idno>
                  <idno type="halauthorid" notation="string">256478-1161158</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-6170-9473</idno>
                  <idno type="IDREF">https://www.idref.fr/241813964</idno>
                  <affiliation ref="#struct-399697"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Julien</forename>
                    <surname>Hemery</surname>
                  </persName>
                  <email type="md5">f2928406fbb8b364ba87ea9cf754398c</email>
                  <email type="domain">supelec.fr</email>
                  <idno type="idhal" notation="numeric">1037486</idno>
                  <idno type="halauthorid" notation="string">1438247-1037486</idno>
                  <affiliation ref="#struct-2544"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Arpad</forename>
                    <surname>Rimmel</surname>
                  </persName>
                  <email type="md5">e682007e97ebc320e25ce8f5e4b634be</email>
                  <email type="domain">lri.fr</email>
                  <idno type="idhal" notation="string">arpad-rimmel</idno>
                  <idno type="idhal" notation="numeric">18807</idno>
                  <idno type="halauthorid" notation="string">6921-18807</idno>
                  <idno type="IDREF">https://www.idref.fr/140527273</idno>
                  <idno type="ORCID">https://orcid.org/0009-0009-7028-3644</idno>
                  <idno type="ISNI">http://isni.org/isni/0000000139853068</idno>
                  <idno type="VIAF">https://viaf.org/viaf/187622533</idno>
                  <affiliation ref="#struct-2544"/>
                  <affiliation ref="#struct-399697"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Joanna</forename>
                    <surname>Tomasik</surname>
                  </persName>
                  <email type="md5">42bb1c984527a10e6bff430a20975060</email>
                  <email type="domain">centralesupelec.fr</email>
                  <idno type="idhal" notation="string">joanna-tomasik</idno>
                  <idno type="idhal" notation="numeric">15160</idno>
                  <idno type="halauthorid" notation="string">29497-15160</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-5560-2821</idno>
                  <idno type="IDREF">https://www.idref.fr/157880559</idno>
                  <affiliation ref="#struct-399697"/>
                  <affiliation ref="#struct-411575"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>International Conference Combinatorial Optimization and Applications (COCOA)</title>
                  <date type="start">2018-12-15</date>
                  <date type="end">2018-12-17</date>
                  <settlement>Atlanta</settlement>
                  <country key="US">United States</country>
                </meeting>
                <imprint>
                  <publisher>Springer International Publishing</publisher>
                  <pubPlace>Cham</pubPlace>
                  <biblScope unit="serie">Lecture Notes in Computer Science</biblScope>
                  <biblScope unit="volume">11346</biblScope>
                  <biblScope unit="pp">566-576</biblScope>
                  <date type="datePub">2018-11-16</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-030-04651-4_38</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Online algorithms</term>
                <term xml:lang="en">Competitive analysis</term>
                <term xml:lang="en">Canadian traveller problem</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-cc">Computer Science [cs]/Computational Complexity [cs.CC]</classCode>
              <classCode scheme="halDomain" n="info.info-ds">Computer Science [cs]/Data Structures and Algorithms [cs.DS]</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>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 (1). This means that randomized memoryless strategies are asymptotically as competitive as deterministic strategies which achieve a ratio 2k + 1 at best.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-399697" status="OLD">
          <orgName>Graphes, Algorithmes et Combinatoire (LRI)</orgName>
          <orgName type="acronym">GALaC - LRI</orgName>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>Université Paris-Sud ; bât. 650 Lovelace ; 91405 Orsay Cedex</addrLine>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-2544" type="direct"/>
            <relation active="#struct-92966" type="indirect"/>
            <relation active="#struct-411575" type="indirect"/>
            <relation name="UMR8623" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-2544" status="OLD">
          <idno type="RNSR">199812948M</idno>
          <orgName>Laboratoire de Recherche en Informatique</orgName>
          <orgName type="acronym">LRI</orgName>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>LRI - Bâtiments 650-660 Université Paris-Sud 91405 Orsay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lri.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-92966" type="direct"/>
            <relation active="#struct-411575" type="direct"/>
            <relation name="UMR8623" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-411575" status="VALID">
          <idno type="IdRef">184443237</idno>
          <idno type="ROR">https://ror.org/019tcpt25</idno>
          <orgName>CentraleSupélec</orgName>
          <desc>
            <address>
              <addrLine>3, rue Joliot Curie,Plateau de Moulon,91192 GIF-SUR-YVETTE Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.centralesupelec.fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-92966" status="OLD">
          <idno type="ROR">https://ror.org/028rypz17</idno>
          <orgName>Université Paris-Sud - Paris 11</orgName>
          <orgName type="acronym">UP11</orgName>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>Bâtiment 300 - 91405 Orsay cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.u-psud.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>