منابع مشابه
Stable Flows over Time
In 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 ne...
متن کاملQuickest Flows Over Time
Flows 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. Traditionally, flows over time are solved in time-expanded networks that contain one copy of the original network for each discrete time step. While this method makes available the whole algorithmic to...
متن کاملGeneralized Maximum Flows over Time
Flows over time and generalized ows are two advanced network ow models of utmost importance, as they incorporate two crucial features occurring in numerous real-life networks. Flows over time feature time as a problem dimension and allow to realistically model the fact that commodities (goods, information, etc.) are routed through a network over time. Generalized ows allow for gain/loss factors...
متن کاملFlows over time in time-varying networks
There has been much research on network flows over time due to their important role in real world applications. This has led to many results, but the more challenging continuous time model still lacks some of the key concepts and techniques that are the cornerstones of static network flows. The aim of this paper is to advance the state of the art for dynamic network flows by developing the cont...
متن کاملImplicit Maximization of Flows over Time
Flows over time may be maximized by computing a static maximum flow on the corresponding time-expanded network, which contains a copy of the original network for each discrete time step. This makes available the whole algorithmic toolbox developed for static flows. The major drawback of this method compared to a polynomial (motivated by Ford and Fulkerson [6, 7]) is that the time-expanded netwo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2013
ISSN: 1999-4893
DOI: 10.3390/a6030532