- freely available
Stable Flows over Time
AbstractIn this paper, the notion of stability is extended to network flows over time. As a useful device in our proofs, we present an elegant preflow-push variant of the Gale-Shapley algorithm that operates directly on the given network and computes stable flows in pseudo-polynomial time, both in the static flow and the flow over time case. We show periodical properties of stable flows over time on networks with an infinite time horizon. Finally, we discuss the influence of storage at vertices, with different results depending on the priority of the corresponding holdover edges.
Share & Cite This Article
Cseh, Á.; Matuschke, J.; Skutella, M. Stable Flows over Time. Algorithms 2013, 6, 532-545.View more citation formats
Cseh Á, Matuschke J, Skutella M. Stable Flows over Time. Algorithms. 2013; 6(3):532-545.Chicago/Turabian Style
Cseh, Ágnes; Matuschke, Jannik; Skutella, Martin. 2013. "Stable Flows over Time." Algorithms 6, no. 3: 532-545.
Notes: Multiple requests from the same IP address are counted as one view.