by Serge Plotkin, Eva Tardos
ftp://ftp.orie.cornell.edu/pub/techreps/TR1042.ps.Z
Add To MetaCart
Abstract:
bounds on the max-flow min-cut ratio for
Citations
|
483
|
Flows in networks
– Ford, Fulkerson
- 1962
|
|
207
|
An approximate max-flow min-cut theorems for uniform multicommodity flow problem with applications to approximation algorithms
– Leighton, Rao
- 1988
|
|
160
|
Fast approximation algorithms for multicommodity flow problems
– Leighton, Makedon, et al.
- 1995
|
|
106
|
Approximate max-flow min-(multi)cut theorems and their applications
– Garg, Vazirani, et al.
|
|
66
|
Multicommodity flows in planar graphs
– Okamura, Seymour
- 1981
|
|
52
|
Approximating minimum feedback sets and multi-cuts in directed graphs
– Even, Naor, et al.
- 1995
|
|
27
|
Matroids and Multicommodity Flows
– Seymour
- 1981
|
|
9
|
Planar graphs, multicommodity flow, and network decomposition
– Klein, Plotkin, et al.
- 1993
|
|
8
|
An approximate max-flow min-cut relation for multicommodity flow, with applications. Combinatorica, to appear. Preliminary version appeared as "Approximation through multicommodity flow
– Klein, Rao, et al.
- 1990
|
|
8
|
VLSi partitioning approximation algorithms based on multicommodity flow and other techniques
– Tragoudas
- 1991
|
|
4
|
Bounds on the max-flow min-cut ratio for directed multicommodity flows. Unpublished Manuscript
– Klein, Plotkin, et al.
- 1993
|
|
2
|
Packing directed circuits fractionally. Unpublished manuscript. Revised
– Seymour
- 1993
|
|
1
|
Improved approximations for the min-cut ratio and the flux
– Tragoudas
|
