<?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-01105083</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-24T23:31:40+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size</title>
            <author role="aut">
              <persName>
                <forename type="first">Mathieu</forename>
                <surname>Chapelle</surname>
              </persName>
              <idno type="halauthorid">408266-0</idno>
              <affiliation ref="#struct-303388"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Manfred</forename>
                <surname>Cochefert</surname>
              </persName>
              <idno type="idhal" notation="numeric">768994</idno>
              <idno type="halauthorid" notation="string">724755-768994</idno>
              <idno type="IDREF">https://www.idref.fr/185870821</idno>
              <affiliation ref="#struct-402694"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Dieter</forename>
                <surname>Kratsch</surname>
              </persName>
              <email type="md5">7b1546700ee9326175e7e8a8f916f344</email>
              <email type="domain">yopmail.com</email>
              <idno type="idhal" notation="string">dieter-kratsch</idno>
              <idno type="idhal" notation="numeric">753810</idno>
              <idno type="halauthorid" notation="string">2279-753810</idno>
              <affiliation ref="#struct-402694"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Romain</forename>
                <surname>Letourneur</surname>
              </persName>
              <email type="md5">a1ab9e1bb757c380da02a881f36e6f82</email>
              <email type="domain">univ-orleans.fr</email>
              <idno type="idhal" notation="numeric">963206</idno>
              <idno type="halauthorid" notation="string">882634-963206</idno>
              <affiliation ref="#struct-1625"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Mathieu</forename>
                <surname>Liedloff</surname>
              </persName>
              <email type="md5">b6f5c3211e1bcd9ac43911b6aa86dd28</email>
              <email type="domain">univ-orleans.fr</email>
              <idno type="idhal" notation="string">mathieu-liedloff</idno>
              <idno type="idhal" notation="numeric">2195</idno>
              <idno type="halauthorid" notation="string">10248-2195</idno>
              <idno type="ARXIV">https://arxiv.org/a/http://arxiv.org/a/liedloff_m_1</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-2518-606X</idno>
              <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=NGFc_JYAAAAJ&amp;hl=fr</idno>
              <idno type="IDREF">https://www.idref.fr/121018210</idno>
              <affiliation ref="#struct-1625"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Mathieu</forename>
                <surname>Liedloff</surname>
              </persName>
              <email type="md5">b6f5c3211e1bcd9ac43911b6aa86dd28</email>
              <email type="domain">univ-orleans.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2015-01-19 16:51:41</date>
              <date type="whenModified">2026-01-28 12:34:05</date>
              <date type="whenReleased">2015-01-19 16:51:41</date>
              <date type="whenProduced">2014-09-10</date>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="146190">
                <persName>
                  <forename>Mathieu</forename>
                  <surname>Liedloff</surname>
                </persName>
                <email type="md5">b6f5c3211e1bcd9ac43911b6aa86dd28</email>
                <email type="domain">univ-orleans.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01105083</idno>
            <idno type="halUri">https://hal.science/hal-01105083</idno>
            <idno type="halBibtex">chapelle:hal-01105083</idno>
            <idno type="halRefHtml">&lt;i&gt;Parameterized and Exact Computation - 9th International Symposium&lt;/i&gt;, Sep 2014, Wroclaw, Poland. pp.147-158, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-319-13524-3_13"&gt;&amp;#x27E8;10.1007/978-3-319-13524-3_13&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Parameterized and Exact Computation - 9th International Symposium, Sep 2014, Wroclaw, Poland. pp.147-158, &amp;#x27E8;10.1007/978-3-319-13524-3_13&amp;#x27E9;</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-ORLEANS">Université d'Orléans</idno>
            <idno type="stamp" n="ENSI-BOURGES">Ecole Nationale Supérieure d'Ingénieurs de Bourges</idno>
            <idno type="stamp" n="MSL">Modelisation Systemes Langages</idno>
            <idno type="stamp" n="MSL-THESE">Modelisation Systemes Langages</idno>
            <idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</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">Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Mathieu</forename>
                    <surname>Chapelle</surname>
                  </persName>
                  <idno type="halauthorid">408266-0</idno>
                  <affiliation ref="#struct-303388"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Manfred</forename>
                    <surname>Cochefert</surname>
                  </persName>
                  <idno type="idhal" notation="numeric">768994</idno>
                  <idno type="halauthorid" notation="string">724755-768994</idno>
                  <idno type="IDREF">https://www.idref.fr/185870821</idno>
                  <affiliation ref="#struct-402694"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Dieter</forename>
                    <surname>Kratsch</surname>
                  </persName>
                  <email type="md5">7b1546700ee9326175e7e8a8f916f344</email>
                  <email type="domain">yopmail.com</email>
                  <idno type="idhal" notation="string">dieter-kratsch</idno>
                  <idno type="idhal" notation="numeric">753810</idno>
                  <idno type="halauthorid" notation="string">2279-753810</idno>
                  <affiliation ref="#struct-402694"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Romain</forename>
                    <surname>Letourneur</surname>
                  </persName>
                  <email type="md5">a1ab9e1bb757c380da02a881f36e6f82</email>
                  <email type="domain">univ-orleans.fr</email>
                  <idno type="idhal" notation="numeric">963206</idno>
                  <idno type="halauthorid" notation="string">882634-963206</idno>
                  <affiliation ref="#struct-1625"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Mathieu</forename>
                    <surname>Liedloff</surname>
                  </persName>
                  <email type="md5">b6f5c3211e1bcd9ac43911b6aa86dd28</email>
                  <email type="domain">univ-orleans.fr</email>
                  <idno type="idhal" notation="string">mathieu-liedloff</idno>
                  <idno type="idhal" notation="numeric">2195</idno>
                  <idno type="halauthorid" notation="string">10248-2195</idno>
                  <idno type="ARXIV">https://arxiv.org/a/http://arxiv.org/a/liedloff_m_1</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-2518-606X</idno>
                  <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=NGFc_JYAAAAJ&amp;hl=fr</idno>
                  <idno type="IDREF">https://www.idref.fr/121018210</idno>
                  <affiliation ref="#struct-1625"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>Parameterized and Exact Computation - 9th International Symposium</title>
                  <date type="start">2014-09-10</date>
                  <settlement>Wroclaw</settlement>
                  <country key="PL">Poland</country>
                </meeting>
                <imprint>
                  <biblScope unit="serie">Lecture Notes in Computer Science</biblScope>
                  <biblScope unit="volume">8894</biblScope>
                  <biblScope unit="pp">147-158</biblScope>
                  <date type="datePub">2014</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-319-13524-3_13</idno>
            </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>The input of the Tropical Connected Set problem is a vertex-colored graph G=(V,E) and the task is to find a connected subset $S\subseteq V$ of minimum size such that each color of G appears in S . This problem is known to be NP-complete, even when restricted to trees of height at most three. We show that Tropical Connected Set on trees has no subexponential-time algorithm unless the Exponential Time Hypothesis fails. This motivates the study of exact exponential algorithms to solve Tropical Connected Set. We present an O^∗(1.5359n) time algorithm for general graphs and an O^∗(1.2721n) time algorithm for trees.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="regroupinstitution" xml:id="struct-303388" status="VALID">
          <idno type="IdRef">034905812</idno>
          <idno type="ISNI">0000 0001 2348 0746</idno>
          <idno type="ROR">https://ror.org/01r9htc13</idno>
          <orgName>Université libre de Bruxelles = Free University of Brussels</orgName>
          <orgName type="acronym">ULB</orgName>
          <date type="start">1970-01-01</date>
          <desc>
            <address>
              <addrLine>Avenue Franklin Roosevelt 50 - 1050 Bruxelles</addrLine>
              <country key="BE"/>
            </address>
            <ref type="url">https://www.ulb.be/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-402694" status="VALID">
          <idno type="IdRef">109477189</idno>
          <idno type="RNSR">199914410X</idno>
          <idno type="IdUnivLorraine">[UL]RSG--</idno>
          <orgName>Laboratoire d'Informatique Théorique et Appliquée</orgName>
          <orgName type="acronym">LITA</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>Université de Lorraine, Ile du Saulcy, 57045 Metz Cedex 1</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lita.univ-lorraine.fr/</ref>
          </desc>
          <listRelation>
            <relation name="EA3097" active="#struct-413289" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-1625" status="OLD">
          <idno type="IdRef">075434695</idno>
          <idno type="RNSR">200615274F</idno>
          <orgName>Laboratoire d'Informatique Fondamentale d'Orléans</orgName>
          <orgName type="acronym">LIFO</orgName>
          <date type="start">1987-01-01</date>
          <date type="end">2013-12-31</date>
          <desc>
            <address>
              <addrLine>Batiment IIIA 6 Rue Léonard de Vinci - BP 6759 45067 ORLEANS CEDEX 2</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-orleans.fr/lifo/</ref>
          </desc>
          <listRelation>
            <relation name="EA4022" active="#struct-300297" type="direct"/>
            <relation name="EA4022" active="#struct-300379" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-413289" status="VALID">
          <idno type="IdRef">157040569</idno>
          <idno type="IdUnivLorraine">[UL]100--</idno>
          <idno type="ROR">https://ror.org/04vfs2w97</idno>
          <orgName>Université de Lorraine</orgName>
          <orgName type="acronym">UL</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-lorraine.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300297" status="VALID">
          <idno type="IdRef">026402971</idno>
          <idno type="ISNI">0000 0001 2158 1666</idno>
          <idno type="ROR">https://ror.org/014zrew76</idno>
          <orgName>Université d'Orléans</orgName>
          <orgName type="acronym">UO</orgName>
          <desc>
            <address>
              <addrLine>Château de la Source - Avenue du Parc Floral - BP 6749 - 45067 Orléans cedex 2</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-orleans.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300379" status="VALID">
          <orgName>Ecole Nationale Supérieure d'Ingénieurs de Bourges</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>