A. Karzanov. Determining the maximal flow in a network by the method of preflows. Soviet Mathematics Doklady, 15:434--437, 1974.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....repeated m(m Gamma 1) 2 times and so the total complexity of these steps are O(m 2 j V j) operations. The next step of the algorithm is to find the minimum cut in the network defined on step (6) For problems (P g ) and (P s ) this is done in O(n 3 ) time using the Dinic Karzanov algorithm [25,34,44]. For problems (P g ) and (P s ) the interconnections between facilities are given by the graph Gamma = I [ J; E 0 [ E 00 ) In this case the network N q contains at most (2n j E 2 j) edges, whose capacities can be computed in O(j E 0 j j E 00 j) time. So we need O(m(j E 0 j j E ....

A.V. Karzanov, Determining the maximal flow in network by the method of preflows, Soviet Math. Dokl. 15 (1974) 434-437.

.... Theta log 2 jV j) time algorithm, which is the first algorithm within a polylogarithmic factor from the lower bound Omega Gamma jV j Theta jEj) 20] The preflow push method is more time efficient. The first complete method was designed by Goldberg and Tarjan [21] and uses Karzanov s preflows [23]. Goldberg and Tarjan [21] achieve O(jV j jEj log( jV j 2 jEj ) running time and King, Rao, and Tarjan [24] obtain a running time of O(jV j jEj (log jEj jV j log jV j jV j) Goldberg and Rao s algorithm [20] achieves a running time smaller than the Omega Gamma jV j Theta jEj) lower bound ....

A. V. Karzanov. Determining the maximal flow in a network by the method of preflows. DOKLADY: Russian Academy of Sciences Doklady. Mathematics (formerly Soviet Mathematics--Doklady), 15, 1974.

....c(C) of a cut C is defined as the sum of the capacities of the arcs in the cut, i.e. c(C) P (i;j)2C c ij . The minimum cut problem is to find the subset S such that s 2 S, t 62 S and c(S) is as small as possible. It is well known that this problem can be solved in O(jN j 3 ) time, see e.g. [11]. A cut CS is called monotone if there are no arcs directed backwards, i.e. there is no arc (i; j) 2 A such that i 62 S and j 2 S. The minimum monotone cut problem is to find a subset S of the nodes such that s 2 S, t 62 S, C S is monotone and c(CS ) is as small as possible. One way to find a ....

Karzanov, A.V., "Determining the maximal flow in a network by the method of preflows", Soviet Math. Doklady 15 (1984) 434-437.

....as the max flow problem) A survey of the many 1 commodity algorithms can be found in [6] Most of these algorithms rely on finding augmenting paths to increase the flow from source to sink. An exception is the recent algorithm of Goldberg and Tarjan [6] which is based on an algorithm of Karzanov [7]) The latter algorithm maintains a preflow on the network and pushes local flow excess toward the sink along what is estimated to be a shortest path. The best of these algorithms run in O (NM ) steps, where N is the number of nodes in the network and M is the number of edges in the network. ....

A. V. Karzanov. Determining the maximal flow in a network by the method of preflows. Soviet Math. Dokl., 15:434--437, 1974.

....for MTP whose complexity does not depend on edge delays; such an algorithm is called strongly polynomial in the literature on flow algorithms. The proposed algorithm is based on the classical Ford Fulkerson s method; several other flow methods with improved time complexity (e.g. preflow methods [25]) have been extensively studied [2, 19] It would be interesting to see if these methods can be used to design approximation algorithms for MTP with a lower complexity. More work is needed in designing polynomial time approximation algorithms for STP and also in investigating performance ....

A. V. Karzanov. Determining the maximal flow in a network by the method of preflows. Soviet Math. Dokl., 15:434--437, 1974.

....partially supported by the National Science Foundation, Grant DCR 8605952, and the Office of Naval Research, Contract N00014 91 K 1463. 2 R. AHUJA, J. ORLIN, C. STEIN AND R. TARJAN ied by Gusfield, Martel, and Fernandez Baca [21] They developed modifications of the algorithms of Karzanov [25] and Malhotra, Pramodh Kumar, and Maheshwari (MPM) 27] for the maximum flow problem that improved their running times from O(n 3 ) to O(n 2 1 n 2 ) For the bounded degree case, i.e. when the degree of each vertex in V 2 is bounded by a fixed constant, they developed a further modification of ....

.... w) Let U = maxfu(v; w) v; w) 2 e.g. Let source s and sink t be the two distinguished NETWORK FLOW IN BIPARTITE GRAPHS 3 Algorithm Running time, Running time, Running time, general network bipartite network modified version Maximum Flows Dinic[10] n 2 m n 2 1 m does not apply Karzanov[25] n 3 n 2 1 n[21] n 1 m n 3 1 MPM[27] n 3 n 2 1 n[21] does not apply FIFO preflow push n 3 n 2 1 n n 1 m n 3 1 [15] 16] Highest label n 2 p m n 1 n p m n 1 m preflow push[7] minfn 3 1 ; n 2 1 p mg Excess scaling[2] nm n 2 log U n 1 m n 1 n log U n 1 m n 2 1 log U ....

[Article contains additional citation context not shown here]

A. V. Karzanov, Determining the maximal flow in a network by the method of preflows, Soviet Math. Dokl., 15 (1974), pp. 434--437.

....is nondecreasing and must increase after polynomially many augmentations. During the next decade, maximum flow algorithms became faster due to the discovery of powerful new techniques. Dinitz [13] developed the blocking flow method in the context of the shortest augmenting path algorithm; Karzanov [36] stated blocking flows as a separate problem and suggested the use of preflows to solve it. Edmonds and Karp [15] and independently Dinitz [14] developed capacity scaling. Dinitz [14] also shows how to combine blocking flows and capacity scaling to obtain an O (nm) maximum flow algorithm. See ....

.... Capacity Flows year discoverer(s) bound 1951 Dantzig [11] O(n 2 mU) 1956 Ford Fulkerson [17] O(nmU) 1970 Dinitz [13] O(nm 2 ) Edmonds Karp [15] 1970 Dinitz [13] O(n 2 m) 1972 Edmonds Karp [15] O(m 2 log U) Dinitz [14] 1973 Dinitz [14] O(nm log U) Gabow [19] 1974 Karzanov [36] O(n 3 ) 1977 Cherkassky [9] O(n 2 m 1=2 ) 1980 Galil Naamad [20] O(nm log 2 n) 1983 Sleator Tarjan [46] O(nm log n) 1986 Goldberg Tarjan [26] O(nm log(n 2 =m) 1987 Ahuja Orlin [2] O(nm n 2 log U) 1987 Ahuja et al. 3] O(nm log(n p log U=m) 1989 Cheriyan Hagerup ....

A. V. Karzanov. Determining the Maximal Flow in a Network by the Method of Preflows. Soviet Math. Dok., 15:434--437, 1974.

....max flow problem) A survey of the many 1 commodity algorithms can be found in [GT90] Most of these algorithms rely on finding augmenting paths to increase the flow from source to sink. An exception is the recent algorithm of Goldberg and Tarjan [GT90] which is based on an algorithm of Karzanov [Kar74] The latter algorithm maintains a preflow on the network and pushes local flow excess toward the sink along what is estimated to be a shortest path. The best of these algorithms run in O (NM ) steps, where N is the number of nodes in the network and M is the number of edges in the network. ....

A. V. Karzanov. Determining the maximal flow in a network by the method of preflows. Soviet Math. Dokl., 15:434--437, 1974.

....et al. 1] runs in O i nm log i n m p U 2 jj time. Prior to the push relabel method, several studies have shown that Dinitz algorithm [10] is in practice superior to other methods, including the network simplex method [6, 7] FordFulkerson algorithm [11, 12] Karzanov s algorithm [20], and Tarjan s algorithm [23] See e.g. 18] Several recent studies (e.g. 2, 8, 9, 22] show that the push relabel method is superior to Dinitz method in practice. In this paper we study implementations of the push relabel method. We evaluate several operation orderings and distance update ....

A. V. Karzanov. Determining the Maximal Flow in a Network by the Method of Preflows. Soviet Math. Dok., 15:434--437, 1974.

....also [20] Classical books [1, 19] describe earlier work in detail. Most efficient algorithms for the maximum flow are based on the blocking flow and the push relabel methods. The first blocking flow algorithm was developed by Dinitz [14] in the framework of the augmenting path approach. Karzanov [30] was the first to state the finding of a blocking flow as a separate problem and to suggest the use of preflows to solve it. The push relabel method, implicit in Goldberg s algorithm [23] was fully developed by Goldberg and Tarjan [25] The shortest augmenting path algorithm, the blocking flow ....

.... O(n 2 mU) n 2 mU [11] 2 1955 Ford Fulkerson O(nmU) nmU [18] 3 1970 Dinitz O(nm 2 ) nm 2 [14] Edmonds Karp [16] 4 1970 Dinitz O(n 2 m) n 2 m [14] 5 1972 Edmonds Karp O(m 2 log U) m 2 [16] Dinitz [15] 6 1973 Dinitz O(nm log U) nm [15] Gabow [20] 7 1974 Karzanov O(n 3 ) [30] 8 1977 Cherkassky O(n 2 p m) 9] 9 1980 Galil Naamad O(nm log 2 n) 21] 10 1983 Sleator Tarjan O(nm log n) 39] 11 1986 Goldberg Tarjan O(nm log(n 2 =m) 25] 12 1987 Ahuja Orlin O(nm n 2 log U) 2] 13 1987 Ahuja et al. O(nm log(n p log U= m 2) 3] 14 1989 Cheriyan ....

A. V. Karzanov. Determining the Maximal Flow in a Network by the Method of Preflows. Soviet Math. Dok., 15:434--437, 1974.

No context found.

A. Karzanov. Determining the maximal flow in a network by the method of preflows. Soviet Mathematics Doklady, 15:434--437, 1974.

No context found.

A. V. Karzanov, Determining the maximal flow in a network by the method of preflows, Soviet Mathematics Doklady, 15 (1974), pp. 434--437.

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