Fleischer, LisaSkutella, Martin2021-12-172021-12-1720022197-8085https://depositonce.tu-berlin.de/handle/11303/15453http://dx.doi.org/10.14279/depositonce-14226Flows over time (also called dynamic flows) generalize standard network flows by introducing an element of time. They naturally model problems where travel and transmission are not instantaneous. Solving these problems raises issues that do not arise in standard network flows. One issue is the question of storage of flow at intermediate nodes. In most applications (such as, e.g., traffic routing, evacuation planning, telecommunications etc.), intermediate storage is limited, undesired, or prohibited.en510 Mathematikapproximation algorithmsdynamic flowflow over timegraph algorithmsnetwork flowroutingResearch Paper