ChansonRolandV7, PascalFrancis, Checkpoint, bibRecord, 000010

Charlemagne's Challenge: The Periodic Latency Problem

Identifieur interne : 000010 ( PascalFrancis/Checkpoint ); précédent : 000009; suivant : 000011

Charlemagne's Challenge: The Periodic Latency Problem

Auteurs : Sofie Coene [Belgique] ; Frits C. R. Spieksma [Belgique] ; Gerhard J. Woeginger [Pays-Bas]

Source :

Operations research [ 0030-364X ] ; 2011.

RBID : Pascal:11-0343000

Descripteurs français

Pascal (Inist)
- Latence, Temps attente, Routage, File n serveurs, Topologie, Méthode polynomiale, Temps polynomial, Dureté, Périodicité.

English descriptors

KwdEn :
- Hardness, Latency, Multiserver queue, Periodicity, Polynomial method, Polynomial time, Routing, Topology, Waiting time.

Abstract

Latency problems are characterized by their focus on minimizing the waiting time for all clients. We study periodic latency problems, a nontrivial extension of standard latency problems. In a periodic latency problem each client has to be visited regularly: there is a server traveling at unit speed, and there is a set of n clients with given positions. The server must visit the clients over and over again, subject to the constraint that successive visits to client i are at most q_i time units away from each other. We investigate two main problems. In problem PLPP the goal is to find a repeatable route for the server visiting as many clients as possible without violating their q_is. In problem PLP the goal is to minimize the number of servers needed to serve all clients. Depending on the topology of the underlying network, we derive polynomial-time algorithms or hardness results for these two problems. Our results draw sharp separation lines between easy and hard cases.

Affiliations:

Links toward previous steps (curation, corpus...)

to stream PascalFrancis, to step Corpus: 000011
to stream PascalFrancis, to step Curation: 000029

Links to Exploration step

Pascal:11-0343000

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Charlemagne's Challenge: The Periodic Latency Problem</title>
<author><name sortKey="Coene, Sofie" sort="Coene, Sofie" uniqKey="Coene S" first="Sofie" last="Coene">Sofie Coene</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Operations Research Group, Katholieke Universiteit Leuven</s1>
<s2>3000 Leuven</s2>
<s3>BEL</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Belgique</country>
<placeName><region type="province" nuts="2">Province du Brabant flamand</region>
<settlement type="city">Louvain</settlement>
</placeName>
<orgName type="university">Katholieke Universiteit Leuven</orgName>
</affiliation>
</author>
<author><name sortKey="Spieksma, Frits C R" sort="Spieksma, Frits C R" uniqKey="Spieksma F" first="Frits C. R." last="Spieksma">Frits C. R. Spieksma</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Operations Research Group, Katholieke Universiteit Leuven</s1>
<s2>3000 Leuven</s2>
<s3>BEL</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Belgique</country>
<placeName><region type="province" nuts="2">Province du Brabant flamand</region>
<settlement type="city">Louvain</settlement>
</placeName>
<orgName type="university">Katholieke Universiteit Leuven</orgName>
</affiliation>
</author>
<author><name sortKey="Woeginger, Gerhard J" sort="Woeginger, Gerhard J" uniqKey="Woeginger G" first="Gerhard J." last="Woeginger">Gerhard J. Woeginger</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Department of Mathematics, Eindhoven University of Technology</s1>
<s2>5600 MB Eindhoven</s2>
<s3>NLD</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>Pays-Bas</country>
<wicri:noRegion>5600 MB Eindhoven</wicri:noRegion>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">11-0343000</idno>
<date when="2011">2011</date>
<idno type="stanalyst">PASCAL 11-0343000 INIST</idno>
<idno type="RBID">Pascal:11-0343000</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000011</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000029</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000010</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000010</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Charlemagne's Challenge: The Periodic Latency Problem</title>
<author><name sortKey="Coene, Sofie" sort="Coene, Sofie" uniqKey="Coene S" first="Sofie" last="Coene">Sofie Coene</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Operations Research Group, Katholieke Universiteit Leuven</s1>
<s2>3000 Leuven</s2>
<s3>BEL</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Belgique</country>
<placeName><region type="province" nuts="2">Province du Brabant flamand</region>
<settlement type="city">Louvain</settlement>
</placeName>
<orgName type="university">Katholieke Universiteit Leuven</orgName>
</affiliation>
</author>
<author><name sortKey="Spieksma, Frits C R" sort="Spieksma, Frits C R" uniqKey="Spieksma F" first="Frits C. R." last="Spieksma">Frits C. R. Spieksma</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Operations Research Group, Katholieke Universiteit Leuven</s1>
<s2>3000 Leuven</s2>
<s3>BEL</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Belgique</country>
<placeName><region type="province" nuts="2">Province du Brabant flamand</region>
<settlement type="city">Louvain</settlement>
</placeName>
<orgName type="university">Katholieke Universiteit Leuven</orgName>
</affiliation>
</author>
<author><name sortKey="Woeginger, Gerhard J" sort="Woeginger, Gerhard J" uniqKey="Woeginger G" first="Gerhard J." last="Woeginger">Gerhard J. Woeginger</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Department of Mathematics, Eindhoven University of Technology</s1>
<s2>5600 MB Eindhoven</s2>
<s3>NLD</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
<country>Pays-Bas</country>
<wicri:noRegion>5600 MB Eindhoven</wicri:noRegion>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Operations research</title>
<title level="j" type="abbreviated">Oper. res.</title>
<idno type="ISSN">0030-364X</idno>
<imprint><date when="2011">2011</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Operations research</title>
<title level="j" type="abbreviated">Oper. res.</title>
<idno type="ISSN">0030-364X</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Hardness</term>
<term>Latency</term>
<term>Multiserver queue</term>
<term>Periodicity</term>
<term>Polynomial method</term>
<term>Polynomial time</term>
<term>Routing</term>
<term>Topology</term>
<term>Waiting time</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Latence</term>
<term>Temps attente</term>
<term>Routage</term>
<term>File n serveurs</term>
<term>Topologie</term>
<term>Méthode polynomiale</term>
<term>Temps polynomial</term>
<term>Dureté</term>
<term>Périodicité</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Latency problems are characterized by their focus on minimizing the waiting time for all clients. We study periodic latency problems, a nontrivial extension of standard latency problems. In a periodic latency problem each client has to be visited regularly: there is a server traveling at unit speed, and there is a set of n clients with given positions. The server must visit the clients over and over again, subject to the constraint that successive visits to client i are at most q<sub>i</sub>
 time units away from each other. We investigate two main problems. In problem PLPP the goal is to find a repeatable route for the server visiting as many clients as possible without violating their q<sub>i</sub>
s. In problem PLP the goal is to minimize the number of servers needed to serve all clients. Depending on the topology of the underlying network, we derive polynomial-time algorithms or hardness results for these two problems. Our results draw sharp separation lines between easy and hard cases.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0030-364X</s0>
</fA01>
<fA02 i1="01"><s0>OPREAI</s0>
</fA02>
<fA03 i2="1"><s0>Oper. res.</s0>
</fA03>
<fA05><s2>59</s2>
</fA05>
<fA06><s2>3</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>Charlemagne's Challenge: The Periodic Latency Problem</s1>
</fA08>
<fA11 i1="01" i2="1"><s1>COENE (Sofie)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>SPIEKSMA (Frits C. R.)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>WOEGINGER (Gerhard J.)</s1>
</fA11>
<fA14 i1="01"><s1>Operations Research Group, Katholieke Universiteit Leuven</s1>
<s2>3000 Leuven</s2>
<s3>BEL</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>Department of Mathematics, Eindhoven University of Technology</s1>
<s2>5600 MB Eindhoven</s2>
<s3>NLD</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s1>674-683</s1>
</fA20>
<fA21><s1>2011</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>7150</s2>
<s5>354000509481170100</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2011 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>1/4 p.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>11-0343000</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Operations research</s0>
</fA64>
<fA66 i1="01"><s0>USA</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>Latency problems are characterized by their focus on minimizing the waiting time for all clients. We study periodic latency problems, a nontrivial extension of standard latency problems. In a periodic latency problem each client has to be visited regularly: there is a server traveling at unit speed, and there is a set of n clients with given positions. The server must visit the clients over and over again, subject to the constraint that successive visits to client i are at most q<sub>i</sub>
 time units away from each other. We investigate two main problems. In problem PLPP the goal is to find a repeatable route for the server visiting as many clients as possible without violating their q<sub>i</sub>
s. In problem PLP the goal is to minimize the number of servers needed to serve all clients. Depending on the topology of the underlying network, we derive polynomial-time algorithms or hardness results for these two problems. Our results draw sharp separation lines between easy and hard cases.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D01A05</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Latence</s0>
<s5>06</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Latency</s0>
<s5>06</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Latencia</s0>
<s5>06</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Temps attente</s0>
<s5>07</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Waiting time</s0>
<s5>07</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Tiempo espera</s0>
<s5>07</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Routage</s0>
<s5>08</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Routing</s0>
<s5>08</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Enrutamiento</s0>
<s5>08</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>File n serveurs</s0>
<s5>09</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Multiserver queue</s0>
<s5>09</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Fila n servidores</s0>
<s5>09</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Topologie</s0>
<s5>10</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Topology</s0>
<s5>10</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Topología</s0>
<s5>10</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Méthode polynomiale</s0>
<s5>11</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Polynomial method</s0>
<s5>11</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Método polinomial</s0>
<s5>11</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Temps polynomial</s0>
<s5>12</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Polynomial time</s0>
<s5>12</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Tiempo polinomial</s0>
<s5>12</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Dureté</s0>
<s5>13</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Hardness</s0>
<s5>13</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Dureza</s0>
<s5>13</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Périodicité</s0>
<s5>14</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Periodicity</s0>
<s5>14</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Periodicidad</s0>
<s5>14</s5>
</fC03>
<fN21><s1>234</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
</standard>
</inist>
<affiliations><list><country><li>Belgique</li>
<li>Pays-Bas</li>
</country>
<region><li>Province du Brabant flamand</li>
</region>
<settlement><li>Louvain</li>
</settlement>
<orgName><li>Katholieke Universiteit Leuven</li>
</orgName>
</list>
<tree><country name="Belgique"><region name="Province du Brabant flamand"><name sortKey="Coene, Sofie" sort="Coene, Sofie" uniqKey="Coene S" first="Sofie" last="Coene">Sofie Coene</name>
</region>
<name sortKey="Spieksma, Frits C R" sort="Spieksma, Frits C R" uniqKey="Spieksma F" first="Frits C. R." last="Spieksma">Frits C. R. Spieksma</name>
</country>
<country name="Pays-Bas"><noRegion><name sortKey="Woeginger, Gerhard J" sort="Woeginger, Gerhard J" uniqKey="Woeginger G" first="Gerhard J." last="Woeginger">Gerhard J. Woeginger</name>
</noRegion>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/ChansonRoland/explor/ChansonRolandV7/Data/PascalFrancis/Checkpoint

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000010 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 000010 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    ChansonRoland
   |area=    ChansonRolandV7
   |flux=    PascalFrancis
   |étape=   Checkpoint
   |type=    RBID
   |clé=     Pascal:11-0343000
   |texte=   Charlemagne's Challenge: The Periodic Latency Problem
}}

This area was generated with Dilib version V0.6.39.
Data generation: Thu Mar 21 08:12:28 2024. Site generation: Thu Mar 21 08:18:57 2024

	Serveur d'exploration sur la Chanson de Roland
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la Chanson de Roland

Charlemagne's Challenge: The Periodic Latency Problem

Charlemagne's Challenge: The Periodic Latency Problem

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri