An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms | IEEE Conference Publication | IEEE Xplore