The following publications are possibly variants of this publication:
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithmsFrank Thomson Leighton, Satish Rao. JACM, 46(6):787-832, 1999. [doi]
- An Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with ApplicationsPhilip N. Klein, Satish Rao, Ajit Agrawal, R. Ravi. combinatorica, 15(2):187-202, 1995.
- Fast Approximation Algorithms for Multicommodity Flow ProblemsFrank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, Éva Tardos, Spyros Tragoudas. stoc 1991: 101-111
- Fast Approximation Algorithms for Multicommodity Flow ProblemsFrank Thomson Leighton, Fillia Makedon, Serge A. Plotkin, Clifford Stein, Éva Stein, Spyros Tragoudas. jcss, 50(2):228-243, 1995.