Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, November 20, 2001, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Katharina Langkau (TU Berlin)
In the 1960's, Ford and Fulkerson introduced dynamic network flows to add time to the standard network flow model. Since then, dynamic flows have been used widely to model network-structured problems over time: problems in transportation, electronic communication, and job scheduling.
A dynamic flow generalizes standard flow by the addition of time. A standard network consists of a set of vertices V, a set of arcs E, and a capacity function from the arc set to the real numbers. In addition, a dynamic-flow network has travel times associated with the arcs. The travel time of an arc is the amount of time it takes for flow to travel from one end of the arc to the other.
Ford and Fulkerson considered maximum dynamic flows and showed that the problem can be solved in polynomial time. In my talk, I want to present the basic concepts of dynamic network flows and sketch the proof of the Ford and Fulkerson result for maximum dynamic flows.
Automatic MiSe System Software Version 1.4803M | admin login