An o(log k) approximate min-cut max-flow theorem and approximation algorithm (1998)

by Y Aumann, Y Rabani
Venue:In Proceedings of the ACM Symposium on the Theory of Computing