MPI-INF Logo
Publications

Server    domino.mpi-inf.mpg.de

Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop

Author, Editor
Author(s):
Hall, Alex
Hippler, Steffen
Skutella, Martin
dblp
dblp
dblp
Not MPG Author(s):
Hall, Alex
Hippler, Steffen
Editor(s):
Baeten, Jos C.M.
Lenstra, Jan Karel
Parrow, Joachim
Woeginger, Gerhard J.
dblp
dblp
dblp
dblp
Not MPII Editor(s):
Baeten, Jos C.M.
Lenstra, Jan Karel
Parrow, Joachim
Woeginger, Gerhard J.
BibTeX cite key*:
HallHipplerSkutella2003
Title, Booktitle
Title*:
Multicommodity Flows Over Time: Efficient Algorithms and Complexity
Booktitle*:
Automata, languages and programming : 30th International Colloquium, ICALP 2003
Event, URLs
Conference URL::
http://www.win.tue.nl/icalp2003/
Downloading URL:
Event Address*:
Eindhoven, The Netherlands
Language:
English
Event Date*
(no longer used):
Organization:
Event Start Date:
30 June 2003
Event End Date:
4 July 2003
Publisher
Name*:
Springer
URL:
http://www.springer.de/
Address*:
Berlin, Germany
Type:
Vol, No, Year, pp.
Series:
Lecture Notes in Computer Science
Volume:
2719
Number:
Month:
June
Pages:
397-409
Year*:
2003
VG Wort Pages:
25
ISBN/ISSN:
3-540-40493-7
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) Abstract:
Flow variation over time is an important feature in network flow
problems arising in various applications such as road or air traffic
control, production systems, communication networks (e.g., the
Internet), and financial flows. The common characteristic are
networks with capacities and transit times on the arcs which specify
the amount of time it takes for flow to travel through a particular
arc. Moreover, in contrast to static flow problems, flow values on
arcs may change with time in these networks.

While the `maximum $s$-$t$-flow over time' problem can be solved
efficiently and `min-cost flows over time' are known to be NP-hard,
the complexity of (fractional) `multicommodity flows over time' has
been open for many years. We prove that this problem is NP-hard,
even for series-parallel networks, and present new and efficient
algorithms under certain assumptions on the transit times or on the
network topology. As a result, we can draw a complete picture of
the complexity landscape for flow over time problems.
Keywords:
network flow, routing, flow over time, dynamic flow, complexity, efficient algorithm
Download
Access Level:
Intranet

Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Algorithms and Complexity Group
MPG Subsubunit:
Combinatorial Optimization Group
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{HallHipplerSkutella2003,
AUTHOR = {Hall, Alex and Hippler, Steffen and Skutella, Martin},
EDITOR = {Baeten, Jos C.M. and Lenstra, Jan Karel and Parrow, Joachim and Woeginger, Gerhard J.},
TITLE = {Multicommodity Flows Over Time: Efficient Algorithms and Complexity},
BOOKTITLE = {Automata, languages and programming : 30th International Colloquium, ICALP 2003},
PUBLISHER = {Springer},
YEAR = {2003},
VOLUME = {2719},
PAGES = {397--409},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Eindhoven, The Netherlands},
MONTH = {June},
ISBN = {3-540-40493-7},
}


Entry last modified by Christine Kiesel, 06/15/2004
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Martin Skutella
Created
01/19/2004 11:23:42 AM
Revisions
5.
4.
3.
2.
1.
Editor(s)
Christine Kiesel
Christine Kiesel
Christine Kiesel
Christine Kiesel
Christine Kiesel
Edit Dates
15.06.2004 14:35:19
15.06.2004 14:34:33
15.06.2004 14:33:33
14.06.2004 13:00:20
04.05.2004 16:11:06