Goldberg, A., Tarjan, R.: Solving minimum-cost flow problems by successive approximation. In: Proceedings of the nineteenth annual ACM conference on Theory of computing, ACM Press (1987) 7--18 Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents
Dual Coordinate Step Methods For Linear Network Flow Problems - BERTSEKAS, ECKSTEIN (1988) (9 citations) (Correct)
Dual Coordinate Step Methods For Linear Network Flow Problems - BERTSEKAS, ECKSTEIN (1988) (9 citations) (Correct)
ε-Relaxations and Auction Methods for.. - Bertsekas.. (1996) (Correct)
Fast Approximation Algorithms for Multicommodity Flow.. - Leighton, Makedon.. (1992) (74 citations) (Correct)
On an Integer Multicommodity Flow Problem from the Airplane .. - Verweij, Aardal, Kant (1997) (1 citation) (Correct)
Approximation Algorithms for Multicommodity Flow and Shop.. - Stein (1992) (16 citations) (Correct)
Routing Restorable Bandwidth Guaranteed Connections using .. - Kar, Kodialam, Lakshman (2002) (9 citations) (Correct)
Methods for Optimizing Register Placement in Synchronous.. - Chabini, Savaria (2001) (Correct)
Scheduling for ReMove and other partially connected architectures - Roos (2001) (Correct)
Routing Restorable Bandwidth Guaranteed Connections using .. - Kar, Kodialam, Lakshman (2002) (9 citations) (Correct)
Adding Multiple Cost Constraints to Combinatorial.. - Karger, Plotkin (1995) (32 citations) (Correct)
Centralized and Distributed Algorithms for Network Scheduling - Fizzano (Correct)
Minimum Interference Routing of Bandwidth Guaranteed.. - Kar, Kodialam, Lakshman (2000) (18 citations) (Correct)
Generalized Maximum Flow Algorithms - Wayne (1999) (Correct)
Minimum Interference Routing with Applications to MPLS.. - Kodialam, Lakshman (2000) (66 citations) (Correct)
Network Problems with Non-Polynomial - Weights And Applications (Correct)
Faster Approximation Algorithms for the Unit Capacity.. - Klein, Plotkin, al. (1991) (44 citations) (Correct)
Implementing Approximation Algorithms for the Single-Source.. - Jingde Du And (Correct)
Exact and Approximation Algorithms for Network Flow and.. - Kolliopoulos (1998) (2 citations) (Correct)
Efficient Dynamic Network Flow Algorithms - Hoppe (1995) (7 citations) (Correct)
Integrated Dynamic IP and Wavelength Routing in IP over WDM.. - Kodialam, Lakshman (2001) (13 citations) (Correct)
Data-level Parallel Solution of Min-cost Network Flow Problems.. - Li, Zenios (1994) (Correct)
Data-level Parallel Solution of Min-cost Network Flow Problems.. - Li, Zenios (1994) (Correct)
Combinatorial Algorithms - For The Generalized Self-citation (Goldberg) (Correct)
Combinatorial Algorithms for the Generalized Circulation.. - Goldberg, Plotkin, Tardos (1989) (15 citations) Self-citation (Goldberg) (Correct)
First 50 documents
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