Curation
PascalFrancis
Racine
Curation
Checkpoint
PascalFrancis
Racine
PascalFrancis
Exploration
Accueil
Racine
Racine

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.

Charlemagne's Challenge: The Periodic Latency Problem

Identifieur interne : 000029 ( PascalFrancis/Curation ); précédent : 000028; suivant : 000030

Charlemagne's Challenge: The Periodic Latency Problem

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

Source :

RBID : Pascal:11-0343000

Descripteurs français

English descriptors

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 qi 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 qis. 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.
pA  
A01 01  1    @0 0030-364X
A02 01      @0 OPREAI
A03   1    @0 Oper. res.
A05       @2 59
A06       @2 3
A08 01  1  ENG  @1 Charlemagne's Challenge: The Periodic Latency Problem
A11 01  1    @1 COENE (Sofie)
A11 02  1    @1 SPIEKSMA (Frits C. R.)
A11 03  1    @1 WOEGINGER (Gerhard J.)
A14 01      @1 Operations Research Group, Katholieke Universiteit Leuven @2 3000 Leuven @3 BEL @Z 1 aut. @Z 2 aut.
A14 02      @1 Department of Mathematics, Eindhoven University of Technology @2 5600 MB Eindhoven @3 NLD @Z 3 aut.
A20       @1 674-683
A21       @1 2011
A23 01      @0 ENG
A43 01      @1 INIST @2 7150 @5 354000509481170100
A44       @0 0000 @1 © 2011 INIST-CNRS. All rights reserved.
A45       @0 1/4 p.
A47 01  1    @0 11-0343000
A60       @1 P
A61       @0 A
A64 01  1    @0 Operations research
A66 01      @0 USA
C01 01    ENG  @0 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 qi 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 qis. 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.
C02 01  X    @0 001D01A05
C03 01  X  FRE  @0 Latence @5 06
C03 01  X  ENG  @0 Latency @5 06
C03 01  X  SPA  @0 Latencia @5 06
C03 02  X  FRE  @0 Temps attente @5 07
C03 02  X  ENG  @0 Waiting time @5 07
C03 02  X  SPA  @0 Tiempo espera @5 07
C03 03  X  FRE  @0 Routage @5 08
C03 03  X  ENG  @0 Routing @5 08
C03 03  X  SPA  @0 Enrutamiento @5 08
C03 04  X  FRE  @0 File n serveurs @5 09
C03 04  X  ENG  @0 Multiserver queue @5 09
C03 04  X  SPA  @0 Fila n servidores @5 09
C03 05  X  FRE  @0 Topologie @5 10
C03 05  X  ENG  @0 Topology @5 10
C03 05  X  SPA  @0 Topología @5 10
C03 06  X  FRE  @0 Méthode polynomiale @5 11
C03 06  X  ENG  @0 Polynomial method @5 11
C03 06  X  SPA  @0 Método polinomial @5 11
C03 07  X  FRE  @0 Temps polynomial @5 12
C03 07  X  ENG  @0 Polynomial time @5 12
C03 07  X  SPA  @0 Tiempo polinomial @5 12
C03 08  X  FRE  @0 Dureté @5 13
C03 08  X  ENG  @0 Hardness @5 13
C03 08  X  SPA  @0 Dureza @5 13
C03 09  X  FRE  @0 Périodicité @5 14
C03 09  X  ENG  @0 Periodicity @5 14
C03 09  X  SPA  @0 Periodicidad @5 14
N21       @1 234
N44 01      @1 OTO
N82       @1 OTO

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

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="1">
<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>
</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="1">
<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>
</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>
</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>
</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="1">
<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>
</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="1">
<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>
</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>
</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>
</record>

Pour manipuler ce document sous Unix (Dilib)

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

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

Ou

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Curation/biblio.hfd -nk 000029 | SxmlIndent | more

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

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

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