Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts

@article{Klein1994FasterAA,
  title={Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts},
  author={Philip N. Klein and Serge A. Plotkin and Clifford Stein and {\'E}va Tardos},
  journal={SIAM J. Comput.},
  year={1994},
  volume={23},
  pages={466-487}
}
This paper describes new algorithms for approximately solving the concurrent multicommodity flow problem with uniform capacities. These algorithms are much faster than algorithms discovered previously. Besides being an important problem in its own right, the uniform-capacity concurrent flow problem has many interesting applications. Leighton and Rao used uniform-capacity concurrent flow to find an approximately "sparsest cut" in a graph and thereby approximately solve a wide variety of graph… CONTINUE READING