Fast Approximation Algorithms for Multicommodity Flow Problems

T. Leighton; F. Makedon; S. Plotkin; C. Stein; E. Tardos; S. Tragoudas

doi:10.1006/jcss.1995.1020

Fast Approximation Algorithms for Multicommodity Flow Problems

Journal of Computer and System Sciences ◽

10.1006/jcss.1995.1020 ◽

1995 ◽

Vol 50 (2) ◽

pp. 228-243 ◽

Cited By ~ 87

Author(s):

T. Leighton ◽

F. Makedon ◽

S. Plotkin ◽

C. Stein ◽

E. Tardos ◽

...

Keyword(s):

Approximation Algorithms ◽

Multicommodity Flow ◽

Flow Problems

Download Full-text

An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms

10.21236/ada211908 ◽

1989 ◽

Cited By ~ 8

Author(s):

Tom Leighton ◽

Satish Rao

Keyword(s):

Approximation Algorithms ◽

Multicommodity Flow ◽

Flow Problems ◽

Min Cut

Download Full-text

Approximation Algorithms for Survivable Multicommodity Flow Problems with Applications to Network Design

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications ◽

10.1109/infocom.2006.92 ◽

2006 ◽

Cited By ~ 4

Author(s):

A. Todimala ◽

B. Ramamurthy

Keyword(s):

Approximation Algorithms ◽

Network Design ◽

Multicommodity Flow ◽

Flow Problems

Download Full-text

An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms

[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1988.21958 ◽

1988 ◽

Cited By ~ 148

Author(s):

T. Leighton ◽

S. Rao

Keyword(s):

Approximation Algorithms ◽

Multicommodity Flow ◽

Flow Problems ◽

Min Cut

Download Full-text

Fast approximation algorithms for multicommodity flow problems

Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 ◽

10.1145/103418.103425 ◽

1991 ◽

Cited By ~ 42

Author(s):

Tom Leighton ◽

Clifford Stein ◽

Fillia Makedon ◽

Éva Tardos ◽

Serge Plotkin ◽

...

Keyword(s):

Approximation Algorithms ◽

Multicommodity Flow ◽

Flow Problems

Download Full-text

Approximation Algorithms for Multicommodity Flow and Normalized Cut Problems: Implementations and Experimental Study

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/978-3-540-27798-9_14 ◽

2004 ◽

pp. 112-121 ◽

Cited By ~ 1

Author(s):

Ying Du ◽

Danny Z. Chen ◽

Xiaodong Wu

Keyword(s):

Experimental Study ◽

Approximation Algorithms ◽

Multicommodity Flow ◽

Normalized Cut ◽

Cut Problems

Download Full-text

Nonoriented Multicommodity Flow Problems

10.1007/springerreference_72535 ◽

2012 ◽

Keyword(s):

Multicommodity Flow ◽

Flow Problems

Download Full-text

A combinatorial equivalence between A class of multicommodity flow problems and the capacitated transportation problem

Mathematical Programming ◽

10.1007/bf01580684 ◽

1976 ◽

Vol 10 (1) ◽

pp. 401-404 ◽

Cited By ~ 22

Author(s):

James R. Evans

Keyword(s):

Transportation Problem ◽

Multicommodity Flow ◽

Flow Problems ◽

Capacitated Transportation Problem

Download Full-text

A minimum mean cycle cancelling method for nonlinear multicommodity flow problems

European Journal of Operational Research ◽

10.1016/s0377-2217(99)00050-8 ◽

2000 ◽

Vol 121 (3) ◽

pp. 532-548 ◽

Cited By ~ 10

Author(s):

A. Ouorou ◽

P. Mahey

Keyword(s):

Multicommodity Flow ◽

Flow Problems ◽

Mean Cycle

Download Full-text

Multicommodity Flow Problems and Decomposition in Telecommunications Networks

Handbook of Optimization in Telecommunications ◽

10.1007/978-0-387-30165-5_10 ◽

2008 ◽

pp. 241-267 ◽

Cited By ~ 1

Author(s):

Abdel Lisser ◽

Philippe Mahey

Keyword(s):

Multicommodity Flow ◽

Telecommunications Networks ◽

Flow Problems

Download Full-text

Global routing by new approximation algorithms for multicommodity flow

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems ◽

10.1109/43.920691 ◽

2001 ◽

Vol 20 (5) ◽

pp. 622-632 ◽

Cited By ~ 64

Author(s):

C. Albrecht

Keyword(s):

Approximation Algorithms ◽

Global Routing ◽

Multicommodity Flow

Download Full-text