<?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-01344126</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-08T21:24:33+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">The expanding search ratio of a graph</title>
            <author role="aut">
              <persName>
                <forename type="first">Spyros</forename>
                <surname>Angelopoulos</surname>
              </persName>
              <email type="md5">093cd5f8095e9473209010113ec8b952</email>
              <email type="domain">lip6.fr</email>
              <idno type="idhal" notation="string">spyros-angelopoulos</idno>
              <idno type="idhal" notation="numeric">738275</idno>
              <idno type="halauthorid" notation="string">26508-738275</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-9819-9158</idno>
              <idno type="IDREF">https://www.idref.fr/250394448</idno>
              <affiliation ref="#struct-406454"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Christoph</forename>
                <surname>Dürr</surname>
              </persName>
              <email type="md5">c180ef5eb575595d447b191373ac362f</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="string">christoph-durr</idno>
              <idno type="idhal" notation="numeric">5030</idno>
              <idno type="halauthorid" notation="string">26507-5030</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-8103-5333</idno>
              <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=71NSquIAAAAJ&amp;hl=fr&amp;oi=ao</idno>
              <idno type="IDREF">https://www.idref.fr/135934842</idno>
              <affiliation ref="#struct-406454"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Thomas</forename>
                <surname>Lidbetter</surname>
              </persName>
              <idno type="halauthorid">1045452-0</idno>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Christoph</forename>
                <surname>Dürr</surname>
              </persName>
              <email type="md5">3b860170cfc1b3b0d9a68966426750f3</email>
              <email type="domain">lip6.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2016-07-11 13:31:00</date>
              <date type="whenModified">2023-04-11 15:16:28</date>
              <date type="whenReleased">2016-07-11 13:31:00</date>
              <date type="whenProduced">2016-02-17</date>
              <ref type="externalLink" target="http://arxiv.org/pdf/1602.06258"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="115705">
                <persName>
                  <forename>Christoph</forename>
                  <surname>Dürr</surname>
                </persName>
                <email type="md5">3b860170cfc1b3b0d9a68966426750f3</email>
                <email type="domain">lip6.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01344126</idno>
            <idno type="halUri">https://hal.science/hal-01344126</idno>
            <idno type="halBibtex">angelopoulos:hal-01344126</idno>
            <idno type="halRefHtml">&lt;i&gt;The 33rd Symposium on Theoretical Aspects of Computer Science (STACS)&lt;/i&gt;, Nicolas Ollinger and Heribert Vollmer, Feb 2016, Orléans, France. pp.4:1--9:14, &lt;a target="_blank" href="https://dx.doi.org/10.4230/LIPIcs.STACS.2016.9"&gt;&amp;#x27E8;10.4230/LIPIcs.STACS.2016.9&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">The 33rd Symposium on Theoretical Aspects of Computer Science (STACS), Nicolas Ollinger and Heribert Vollmer, Feb 2016, Orléans, France. pp.4:1--9:14, &amp;#x27E8;10.4230/LIPIcs.STACS.2016.9&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UPMC" corresp="SORBONNE-UNIVERSITE">Université Pierre et Marie Curie</idno>
            <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="UPMC_POLE_1" corresp="UPMC">UPMC Pôle 1</idno>
            <idno type="stamp" n="SORBONNE-UNIVERSITE">Sorbonne Université</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>
          </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">The expanding search ratio of a graph</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Spyros</forename>
                    <surname>Angelopoulos</surname>
                  </persName>
                  <email type="md5">093cd5f8095e9473209010113ec8b952</email>
                  <email type="domain">lip6.fr</email>
                  <idno type="idhal" notation="string">spyros-angelopoulos</idno>
                  <idno type="idhal" notation="numeric">738275</idno>
                  <idno type="halauthorid" notation="string">26508-738275</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-9819-9158</idno>
                  <idno type="IDREF">https://www.idref.fr/250394448</idno>
                  <affiliation ref="#struct-406454"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Christoph</forename>
                    <surname>Dürr</surname>
                  </persName>
                  <email type="md5">c180ef5eb575595d447b191373ac362f</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="string">christoph-durr</idno>
                  <idno type="idhal" notation="numeric">5030</idno>
                  <idno type="halauthorid" notation="string">26507-5030</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-8103-5333</idno>
                  <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=71NSquIAAAAJ&amp;hl=fr&amp;oi=ao</idno>
                  <idno type="IDREF">https://www.idref.fr/135934842</idno>
                  <affiliation ref="#struct-406454"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Thomas</forename>
                    <surname>Lidbetter</surname>
                  </persName>
                  <idno type="halauthorid">1045452-0</idno>
                </author>
              </analytic>
              <monogr>
                <title level="m">Proc. of the 33rd Symposium on Theoretical Aspects of Computer Science (STACS)</title>
                <meeting>
                  <title>The 33rd Symposium on Theoretical Aspects of Computer Science (STACS)</title>
                  <date type="start">2016-02-17</date>
                  <date type="end">2016-08-20</date>
                  <settlement>Orléans</settlement>
                  <country key="FR">France</country>
                </meeting>
                <respStmt>
                  <resp>conferenceOrganizer</resp>
                  <name>Nicolas Ollinger and Heribert Vollmer</name>
                </respStmt>
                <imprint>
                  <publisher>Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik</publisher>
                  <biblScope unit="serie">Leibniz International Proceedings in Informatics (LIPIcs)</biblScope>
                  <biblScope unit="volume">47</biblScope>
                  <biblScope unit="pp">4:1--9:14</biblScope>
                </imprint>
              </monogr>
              <idno type="arxiv">1602.06258</idno>
              <idno type="doi">10.4230/LIPIcs.STACS.2016.9</idno>
              <ref type="publisher">http://www.univ-orleans.fr/lifo/events/STACS2016/</ref>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <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>We study the problem of searching for a hidden target in an environment that is modeled by an edge-weighted graph. Most of the previous work on this problem considers the pathwise cost formulation, in which the cost incurred by the searcher is the overall time to locate the target, assuming that the searcher moves at unit speed. More recent work introduced the setting of expanding search in which the searcher incurs cost only upon visiting previously unexplored areas of the graph. Such a paradigm is useful in modeling problems in which the cost of re-exploration is negligible (such as coal mining). In our work we study algorithmic and computational issues of expanding search, for a variety of search environments including general graphs, trees and star-like graphs. In particular, we rely on the deterministic and randomized search ratio as the performance measures of search strategies, which were originally introduced by Koutsoupias and Papadimitriou [ICALP 1996] in the context of pathwise search. The search ratio is essentially the best competitive ratio among all possible strategies. Our main objective is to explore how the transition from pathwise to expanding search affects the competitive analysis, which has applications to optimization problems beyond the strict boundaries of search problems. </p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-406454" status="OLD">
          <orgName>Recherche Opérationnelle</orgName>
          <orgName type="acronym">RO</orgName>
          <date type="start">2004-01-01</date>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-233" type="direct"/>
            <relation active="#struct-93591" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-233" status="OLD">
          <idno type="RNSR">199712651U</idno>
          <idno type="ROR">https://ror.org/05krcen59</idno>
          <orgName>Laboratoire d'Informatique de Paris 6</orgName>
          <orgName type="acronym">LIP6</orgName>
          <date type="start">1997-01-01</date>
          <date type="end">2017-12-31</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-93591" type="direct"/>
            <relation name="UMR7606" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-93591" status="OLD">
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Université Pierre et Marie Curie - Paris 6</orgName>
          <orgName type="acronym">UPMC</orgName>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 place Jussieu - 75005 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.upmc.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>