B. Hoppe. Efficient dynamic network flow algorithms. PhD thesis, Cornell University, 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Universally Maximum Flow with Piecewise-Constant Capacities - Fleischer (1998) (1 citation) (Correct)
....and they both provide algorithms to solve this problem, but these do not run in polynomial time. There is no known polynomial time algorithm that solves the universally maximum flow problem. It is not even known if the optimal solution is polynomial in the size of the input. Hoppe and Tardos [7, 8] present an O(mffl Gamma1 (m n log n) log U) algorithm that computes a dynamic flow with the property that the quantity of flow reaching the sink by time t is within (1 Gamma ffl) of the maximum possible for all 1 t T . When all transit times are zero and all capacity functions are ....
B. Hoppe. Efficient Dynamic Network Flow Algorithms. PhD thesis, Cornell University, June 1995. Department of Computer Science Technical Report TR95-1524.
Efficient Continuous-Time Dynamic Network Flow Algorithms - Fleischer, Tardos (1998) (1 citation) (Correct)
....cost circulation computation. Wilkinson [24] and Minieka [16] both describe a simple, but exponential time algorithm to solve the universally maximum flow problem. In their surveys, Aronson [5] and Powell et al. 21] summarize much of the progress made since then. Recently, Hoppe and Tardos [12, 13, 11] have described several polynomial time algorithms for discrete dynamic network problems including approximate universally maximum dynamic flows, lexicographically maximum flows, and dynamic transshipment. There has also been much research on continuous network flows, most of it for very general ....
....from j to i, to cancel fl on e. To do this, if chain flow fl arrives at i at time , then the chain flow fl 0 must arrive at i by time 0 . Similarly, if chain flow fl stops using edge (i; j) at time , then fl 0 must continue sending flow from j until some time 0 . Hoppe and Tardos [13, 11] introduce the use of non standard chain decompositions and show that the dynamic flows induced by the ones used in their algorithms are feasible. These feasible, chain flow induced dynamic flows are called chain decomposable flows. Given any feasible discrete dynamic flow, we can transform this ....
[Article contains additional citation context not shown here]
B. Hoppe. Efficient Dynamic Network Flow Algorithms. PhD thesis, Cornell University, June 1995. Department of Computer Science Technical Report TR95-1524.
Efficient Continuous-Time Dynamic Network Flow Algorithms - Fleischer, Tardos (1996) (1 citation) (Correct)
....Continuous Time Dynamic Network Flow Algorithms L. Fleischer y E. Tardos z August 1996 Abstract We extend the discrete time dynamic flow algorithms presented in [5, 19, 13, 9, 10, 8] to solve the analogous continuous time dynamic flow problems. These problems include finding maximum dynamic flows, quickest flows, universally maximum dynamic flows, lexicographically maximum dynamic flows, dynamic transshipments, and quickest transshipments in networks with capacities and ....
....cost circulation computation. Wilkinson [19] and Minieka [13] both describe a simple, but exponential time algorithm to solve the universally maximum flow problem. In their surveys, Aronson [4] and Powell et al. 16] summarize much of the progress made since then. Recently, Hoppe and Tardos [9, 10, 8] have described several polynomial time algorithms for discrete dynamic network problems including approximate universally maximum dynamic flows, lexicographically maximum flows, and dynamic transshipment. There has also been much research on continuous network flows, most of it for very general ....
[Article contains additional citation context not shown here]
B. Hoppe. Efficient Dynamic Network Flow Algorithms. PhD thesis, Cornell University, June 1995. Department of Computer Science Technical Report TR95-1524.
Quickest Flows Over Time - Fleischer, Skutella (Correct)
No context found.
B. Hoppe. Efficient dynamic network flow algorithms. PhD thesis, Cornell University, 1995.
Minimum Cost Flows over Time without Intermediate Storage - Fleischer, Skutella (2002) (2 citations) (Correct)
No context found.
B. Hoppe. Efficient Dynamic Network Flow Algorithms. PhD thesis, Cornell University, June 1995. Department of Computer Science Technical Report TR95-1524.
An FPTAS for Quickest Multicommodity Flows with.. - Hall, Langkau, Skutella (2003) (Correct)
No context found.
B. Hoppe. Efficient dynamic network flow algorithms. PhD thesis, Cornell University, 1995.
Multicommodity Flows over Time: Efficient Algorithms and.. - Hall, Hippler, Skutella (2003) (Correct)
No context found.
B. Hoppe. Efficient dynamic network flow algorithms. PhD thesis, Cornell University, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC