Köhler, EkkehardLangkau, KatharinaSkutella, Martin2021-12-172021-12-1720022197-8085https://depositonce.tu-berlin.de/handle/11303/15979http://dx.doi.org/10.14279/depositonce-14752Motivated by applications in road traffic control, we study flows in networks featuring special characteristics. In contrast to classical static flow problems, time plays a decisive role. Firstly, there are transit times on the arcs of the network which specify the amount of time it takes for flow to travel through a particular arc; more precisely, flow values on arcs may change over time. Secondly, the transit time of an arc varies with the current amount of flow using this arc. Especially the latter feature is crucial for various real-life applications of flows over time; yet, it dramatically increases the degree of difficulty of the resulting optimization problems.en510 Mathematikapproximation algorithmsdynamic flowflow over timegraph algorithmsnetwork flowroutingtraffic modelsTime-Expanded Graphs for Flow-Dependent Transit TimesResearch Paper