ALBERT — All Library Books, journals and Electronic Records Telegrafenberg

Hits per page

hit 1 - 1 | 1 hit

Sorting

Electronic Resource

Tight bounds on the number of minimum-mean cycle cancellations and related results (1994)

Radzik, Tomasz ; Goldberg, Andrew V.

Springer

Algorithmica 11 (1994), S. 226-242

add to mindlist on the mindlist

Details

ISSN: 1432-0541

Keywords: Network flow problems ; Minimum cost flow ; Minimum cost circulation ; Combinatorial optimization ; Cycle canceling algorithms ; Strongly polynomial algorithms

Source: Springer Online Journal Archives 1860-2000

Topics: Computer Science , Mathematics

Notes: Abstract We prove a tight Θ(min(nm log(nC), nm2)) bound on the number of iterations of the minimum-mean cycle-canceling algorithm of Goldberg and Tarjan [13]. We do this by giving the lower bound and by improving the strongly polynomial upper bound on the number of iterations toO(nm 2). We also give an improved version of the maximum-mean cut canceling algorithm of [7], which is a dual of the minimum-mean cycle-canceling algorithm. Our version of the dual algorithm runs in O(nm2) iterations.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1007/BF01240734

Permalink

	Location	Call Number	Expected	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

hit 1 - 1 | 1 hit