By Topic

Faster algorithms for the generalized network flow problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
T. Radzik ; Dept. of Comput. Sci., King's Coll. London, UK

We consider the generalized network flow problem. Each arc e in the network has a gain factor γ(e). If f(e) units of flow enter arc e, then f(e)γ(e) units arrive at the other end of e. The generalized network flow problem is to maximize the net flow into one specific node, the sink. We give an algorithm which solves this problem in O˜(m2(m+nloglog B)log B) time, where B is the largest integer used to represent the gain factors, the capacities, and the initial supplies at the nodes. If m is O(n(43/-ε) and B is not extremely large, then our bound improves the previous best bound O(m1.5n2log B) given by P.M. Vaidya (1989). Our algorithm is an approximation scheme which in each iteration reduces by a constant factor the difference between the current net flow into the sink and the optimal one. The solution which is within a factor of 1+ξ from the optimum can be computed in O˜(m2n+min{m 2n, m(m+nloglog B)}log(1/ξ)) time. This improves the previous bounds on the approximate generalized flow problem

Published in:

Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on

Date of Conference:

3-5 Nov 1993