Tomasz Radzik  Home/Search
Context
Related
| dcs.kcl.ac.uk/staff/rad...gmf_m2n.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dcs.kcl.ac.uk/staff/radz...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the maximum generalised network flow problem and a supply-scaling algorithmic framework for this problem. We present three network-modification operations, which may significantly decrease the size of the network when the remaining node supplies become small. We use these three operations in Goldfarb, Jin and Orlin's supply-scaling algorithms and prove a ~ O(m 2 n log B) bound on the running time of the resulting algorithm. The previous best time bounds on computing maximum... (Update)
Active bibliography (related documents): More All
0.7: Simple Maximum Flow Algorithms in Lossy Networks - Tardos, Wayne (1997) (Correct)
0.7: Simple Generalized Maximum Flow Algorithms - Tardos, Wayne (1998) (Correct)
0.6: Generalized Maximum Flow Algorithms - Wayne (1999) (Correct)
Similar documents based on text: More All
1.5: Experimental Evaluation of Algorithmic Solutions for the.. - Radzik, Yang (2001) (Correct)
0.8: Polynomial-Time Highest-Gain Augmenting Path Algorithms.. - Goldfarb, Jin, Orlin (1997) (Correct)
0.4: Experimental Study of a Solution Method for Multicommodity Flow.. - Radzik (2000) (Correct)
BibTeX entry: (Update)
@misc{ radzik-contracting,
author = "Tomasz Radzik",
title = "Contracting the Network During Maximum Generalised Network Flow Computation",
url = "citeseer.ist.psu.edu/radzik01contracting.html" }
Citations (may not include all citations):192 Self-adjusting binary search trees (context) - Sleator, Tarjan - 1985
83 Princeton Univ (context) - Ford, Fulkerson et al. - 1962
47 Speeding up Linear Programming Using Fast Matrix Multiplicat.. (context) - Vaidya - 1989
31 Finding minimum-cost circulations by successive approximatio.. (context) - Goldberg, Tarjan - 1990
19 Combinatorial Algorithms for the Generalized Circulation Pro.. - Goldberg, Plotkin et al. - 1991
18 Improved Interior Point Algorithms for Exact and Approximate.. - Kamath, Palmon - 1995
11 Network ows: Theory (context) - Ahuja, Magnanti et al. - 1993
11 A polynomial combinatorial algorithm for generalized minimum.. - Wayne - 1999
9 Polynomial-time highest-gain augmenting path algorithms for .. - Goldfarb, Jin et al. - 1997
8 Generalized networks: A fundamental computer-based planning .. (context) - Glover, Hultz et al. - 1978
7 A faster combinatorial algorithm for the generalized circula.. (context) - Goldfarb, Jin - 1996
4 Speeding up Karmarkar's algorithm for multicommodity ows (context) - Kapoor, Vaidya - 1996
2 Simple generalized maximum ow algorithms (context) - Tardos, Wayne - 1998
1 Faster algorithms for the generalized network ow problem (context) - Radzik - 1998
1 An interior point approach to the generalized ow problem wit.. (context) - Murray - 1992
Documents on the same site (http://www.dcs.kcl.ac.uk/staff/radzik/papers.html):
Experimental Evaluation of Algorithmic Solutions for the.. - Radzik, Yang (2001) (Correct)
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