Improved results for directed multicut
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Directed metrics and directed graph partitioning problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Hardness of cut problems in directed graphs
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
An O(√n)-approximation algorithm for directed sparsest cut
Information Processing Letters
On the max-flow min-cut ratio for directed multicommodity flows
Theoretical Computer Science
On the capacity of information networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Polynomial flow-cut gaps and hardness of directed cut problems
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Improved approximation for directed cut problems
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Approximating Minimum Multicuts by Evolutionary Multi-objective Algorithms
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Graph-theoretic topological control of biological genetic networks
ACC'09 Proceedings of the 2009 conference on American Control Conference
An O(n)-approximation algorithm for directed sparsest cut
Information Processing Letters
The generalized deadlock resolution problem
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
The seminal paper of Leighton and Rao (1988) and subsequent papers presented approximate min-max theorems relating multicommodity flow values and cut capacities in undirected networks, developed the divide-and-conquer method for designing approximation algorithms, and generated novel tools for utilizing linear programming relaxations. Yet, despite persistent research efforts, these achievements could not be extended to directed networks,excluding a few cases that are "symmetric" and therefore similar to undirected networks. This paper is an attempt to remedy the situation. We consider the problem of finding a minimum multicut in a directed multicommodity flow network, and give the first nontrivial upper bounds on the max flow-to-min multicut ratio. Our results are algorithmic, demonstrating nontrivial approximation guarantees.