<?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-01571232</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-19T15:07:59+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Maximum flow under proportional delay constraint</title>
            <author role="aut">
              <persName>
                <forename type="first">Pierre</forename>
                <surname>Bonami</surname>
              </persName>
              <idno type="halauthorid">419322-0</idno>
              <affiliation ref="#struct-244407"/>
              <affiliation ref="#struct-199394"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Dorian</forename>
                <surname>Mazauric</surname>
              </persName>
              <email type="md5">5d34b01b31db3910b8f71c236f14d425</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">dorian-mazauric</idno>
              <idno type="idhal" notation="numeric">6470</idno>
              <idno type="halauthorid" notation="string">23522-6470</idno>
              <idno type="IDREF">https://www.idref.fr/157983455</idno>
              <affiliation ref="#struct-523042"/>
              <affiliation ref="#struct-51872"/>
              <affiliation ref="#struct-199394"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Yann</forename>
                <surname>Vaxès</surname>
              </persName>
              <email type="md5">ab43da32cf57df12b434b4bd24bd85f1</email>
              <email type="domain">lis-lab.fr</email>
              <idno type="idhal" notation="string">yann-vaxes</idno>
              <idno type="idhal" notation="numeric">4966</idno>
              <idno type="halauthorid" notation="string">2533329-4966</idno>
              <idno type="IDREF">https://www.idref.fr/174376359</idno>
              <affiliation ref="#struct-530675"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Dorian</forename>
                <surname>Mazauric</surname>
              </persName>
              <email type="md5">5d34b01b31db3910b8f71c236f14d425</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2017-08-01 18:07:03</date>
              <date type="whenWritten">2017</date>
              <date type="whenModified">2025-10-24 16:48:02</date>
              <date type="whenReleased">2017-08-01 18:24:50</date>
              <date type="whenProduced">2017</date>
              <date type="whenEndEmbargoed">2017-08-01</date>
              <ref type="file" target="https://inria.hal.science/hal-01571232v1/document">
                <date notBefore="2017-08-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01571232v1/file/NEW-2-BMV-TCS-short-2016.pdf" id="file-1571232-1624384">
                <date notBefore="2017-08-01"/>
              </ref>
              <ref type="externalLink" target="https://hal.archives-ouvertes.fr/hal-00947049/file/BMV-2014.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="134063">
                <persName>
                  <forename>Dorian</forename>
                  <surname>Mazauric</surname>
                </persName>
                <email type="md5">5d34b01b31db3910b8f71c236f14d425</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01571232</idno>
            <idno type="halUri">https://inria.hal.science/hal-01571232</idno>
            <idno type="halBibtex">bonami:hal-01571232</idno>
            <idno type="halRefHtml">&lt;i&gt;Theoretical Computer Science&lt;/i&gt;, 2017, 689, pp.58-66. &lt;a target="_blank" href="https://dx.doi.org/10.1016/j.tcs.2017.05.034"&gt;&amp;#x27E8;10.1016/j.tcs.2017.05.034&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Theoretical Computer Science, 2017, 689, pp.58-66. &amp;#x27E8;10.1016/j.tcs.2017.05.034&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1571232-1624384"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-TLN">Université de Toulon</idno>
            <idno type="stamp" n="LIF">Laboratoire d'informatique fondamentale de Marseille</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="UNIV-AMU">Aix Marseille Université</idno>
            <idno type="stamp" n="INRIA-SOPHIA">INRIA Sophia Antipolis - Méditerranée</idno>
            <idno type="stamp" n="EC-MARSEILLE">Ecole Centrale de Marseille</idno>
            <idno type="stamp" n="INRIASO">INRIA-SOPHIA</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="INRIA2017">INRIA2017</idno>
            <idno type="stamp" n="UNIV-COTEDAZUR">Université Côte d'Azur</idno>
            <idno type="stamp" n="LIS-LAB">Laboratoire d'Informatique et Systèmes</idno>
            <idno type="stamp" n="INRIAARTDOI">INRIAARTDOI</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Maximum flow under proportional delay constraint</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Pierre</forename>
                    <surname>Bonami</surname>
                  </persName>
                  <idno type="halauthorid">419322-0</idno>
                  <affiliation ref="#struct-244407"/>
                  <affiliation ref="#struct-199394"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Dorian</forename>
                    <surname>Mazauric</surname>
                  </persName>
                  <email type="md5">5d34b01b31db3910b8f71c236f14d425</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">dorian-mazauric</idno>
                  <idno type="idhal" notation="numeric">6470</idno>
                  <idno type="halauthorid" notation="string">23522-6470</idno>
                  <idno type="IDREF">https://www.idref.fr/157983455</idno>
                  <affiliation ref="#struct-523042"/>
                  <affiliation ref="#struct-51872"/>
                  <affiliation ref="#struct-199394"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Yann</forename>
                    <surname>Vaxès</surname>
                  </persName>
                  <email type="md5">ab43da32cf57df12b434b4bd24bd85f1</email>
                  <email type="domain">lis-lab.fr</email>
                  <idno type="idhal" notation="string">yann-vaxes</idno>
                  <idno type="idhal" notation="numeric">4966</idno>
                  <idno type="halauthorid" notation="string">2533329-4966</idno>
                  <idno type="IDREF">https://www.idref.fr/174376359</idno>
                  <affiliation ref="#struct-530675"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">19594</idno>
                <idno type="issn">0304-3975</idno>
                <idno type="eissn">1879-2294</idno>
                <title level="j">Theoretical Computer Science</title>
                <imprint>
                  <publisher>Elsevier</publisher>
                  <biblScope unit="volume">689</biblScope>
                  <biblScope unit="pp">58-66</biblScope>
                  <date type="datePub">2017</date>
                  <date type="dateEpub">2017</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1016/j.tcs.2017.05.034</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">dynamic programming</term>
                <term xml:lang="en">bounded treewidth</term>
                <term xml:lang="en">linear programming</term>
                <term xml:lang="en">Maximum flow</term>
                <term xml:lang="en">on-off delay constraints</term>
                <term xml:lang="en">polynomial time approximation scheme (PTAS)</term>
              </keywords>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halDomain" n="info.info-ds">Computer Science [cs]/Data Structures and Algorithms [cs.DS]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>Given a network and a set of source destination pairs (connections), we consider the problem of maximizing the sum of the flow under proportional delay constraints. In this paper, the delay for crossing a link is proportional to the total flow crossing this link. If a connection supports non-zero flow, then the sum of the delays along any path corresponding to that connection must be lower than a given bound. The constraints of delay are on-off constraints because if a connection carries zero flow, then there is no constraint for that connection. The difficulty of the problem comes from the choice of the connections supporting non-zero flow. We first prove a general approximation ratio using linear programming for a variant of the problem. We then prove a linear time 2-approximation algorithm when the network is a path. We finally show a Polynomial Time Approximation Scheme when the graph of intersections of the paths has bounded treewidth.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-244407" status="VALID">
          <orgName>IBM ILOG CPLEX [Madrid]</orgName>
          <desc>
            <address>
              <addrLine>Santa Hortensia 26-28 28002 Madrid</addrLine>
              <country key="ES"/>
            </address>
            <ref type="url">http://www-01.ibm.com/software/commerce/optimization/cplex-optimizer/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-199394" status="OLD">
          <idno type="RNSR">201220259Y</idno>
          <orgName>Laboratoire d'informatique Fondamentale de Marseille</orgName>
          <orgName type="acronym">LIF</orgName>
          <date type="start">2012</date>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>Parc Scientifique et Technologique de Luminy 163, avenue de Luminy F-13288 Marseille Cedex 9</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lif.univ-mrs.fr/</ref>
          </desc>
          <listRelation>
            <relation name="UMR7279" active="#struct-198056" type="direct"/>
            <relation name="UMR7279" active="#struct-300415" type="direct"/>
            <relation name="UMR7279" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-523042" status="OLD">
          <idno type="IdRef">185433669</idno>
          <orgName>COMUE Université Côte d'Azur (2015-2019)</orgName>
          <orgName type="acronym">COMUE UCA</orgName>
          <date type="start">2015-03-01</date>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>Parc Valrose, 28, avenue Valrose 06108 Nice Cedex 2</addrLine>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="researchteam" xml:id="struct-51872" status="VALID">
          <idno type="RNSR">200818987H</idno>
          <idno type="ROR">https://ror.org/03ad2mf95</idno>
          <orgName>Algorithms, Biology, Structure</orgName>
          <orgName type="acronym">ABS</orgName>
          <date type="start">2008-07-08</date>
          <date type="end">2027-12-31</date>
          <desc>
            <address>
              <addrLine>2004 route des Lucioles, BP 9306902 Sophia-Antipolis</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/abs</ref>
          </desc>
          <listRelation>
            <relation active="#struct-34586" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-530675" status="VALID">
          <orgName>Algorithmique, Combinatoire et Recherche Opérationnelle</orgName>
          <orgName type="acronym">ACRO</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lis-lab.fr/acro</ref>
          </desc>
          <listRelation>
            <relation active="#struct-527033" type="direct"/>
            <relation name="UMR7020" active="#struct-198056" type="indirect"/>
            <relation name="UMR7020" active="#struct-303091" type="indirect"/>
            <relation name="UMR7020" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-198056" status="VALID">
          <idno type="IdRef">15863621X</idno>
          <idno type="ISNI">0000 0001 2176 4817</idno>
          <idno type="ROR">https://ror.org/035xkbk20</idno>
          <orgName>Aix Marseille Université</orgName>
          <orgName type="acronym">AMU</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>Aix-Marseille UniversitéJardins du Pharo58 Boulevard Charles Livon13284 Marseille cedex 7</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-amu.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300415" status="VALID">
          <idno type="ISNI">0000 0004 1762 2703</idno>
          <idno type="ROR">https://ror.org/040baw385</idno>
          <orgName>École Centrale de Marseille</orgName>
          <orgName type="acronym">ECM</orgName>
          <date type="start">2006-09-27</date>
          <desc>
            <address>
              <addrLine>Pôle de l'étoile - Technopole de Château-Gombert - 38 rue Frédéric Joliot-Curie - 13013 Marseille</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.centrale-marseille.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>
        <org type="laboratory" xml:id="struct-34586" status="VALID">
          <idno type="RNSR">198318250R</idno>
          <idno type="ROR">https://ror.org/01nzkaw91</idno>
          <orgName>Centre Inria d'Université Côte d'Azur</orgName>
          <desc>
            <address>
              <addrLine>2004 route des Lucioles BP 93 06902 Sophia Antipolis</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/sophia/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-527033" status="VALID">
          <idno type="IdRef">234768002</idno>
          <idno type="RNSR">201822714R</idno>
          <idno type="ROR">https://ror.org/0257sgk90</idno>
          <idno type="Wikidata">Q52605252</idno>
          <orgName>Laboratoire d'Informatique et des Systèmes (LIS) (Marseille, Toulon)</orgName>
          <orgName type="acronym">LIS</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>Aix Marseille Université – Campus de Saint Jérôme – Bat. Polytech, 52 Av. Escadrille Normandie Niemen, 13397 Marseille Cedex 20</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lis-lab.fr</ref>
          </desc>
          <listRelation>
            <relation name="UMR7020" active="#struct-198056" type="direct"/>
            <relation name="UMR7020" active="#struct-303091" type="direct"/>
            <relation name="UMR7020" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-303091" status="VALID">
          <idno type="IdRef">031122337</idno>
          <idno type="ROR">https://ror.org/02m9kbe37</idno>
          <orgName>Université de Toulon</orgName>
          <orgName type="acronym">UTLN</orgName>
          <desc>
            <address>
              <addrLine>Avenue de l'Université - BP 20132 - 83957 La Garde Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-tln.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>