On the max-flow min-cut ratio for directed multicommodity flows

Authors:
M. T. Hajiaghayi;Tom Leighton
Affiliations:
Department of Mathematics and Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA;Department of Mathematics and Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA
Venue:
Theoretical Computer Science
Year:
2006

Citing 8
Cited 2

Cut problems and their application to divide-and-conquer

Approximation algorithms for NP-hard problems
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

Journal of the ACM (JACM)
Improved results for directed multicut

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Edge disjoint paths revisited

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating Directed Multicuts

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

Journal of Computer and System Sciences
Graph decomposition and a greedy algorithm for edge-disjoint paths

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A Lower Bound On The Integrality Gap For Minimum Multicut In Directed Networks

Combinatorica

Approximation algorithms and hardness results for cycle packing problems

ACM Transactions on Algorithms (TALG)
QoS analysis of weighted multi-state probabilistic networks via decision diagrams

SAFECOMP'10 Proceedings of the 29th international conference on Computer safety, reliability, and security

Quantified Score

Hi-index	5.23

Visualization

Abstract

We present a pure combinatorial problem whose solution determines max-flow min-cut ratio for directed multicommodity flows. In addition, this combinatorial problem has applications in improving the approximation factor of the greedy algorithm for the maximum edge disjoint path problem. More precisely, our upper bound improves the approximation factor for this problem to O(n3/4).