Cut problems and their application to divide-and-conquer
Approximation algorithms for NP-hard problems
Combinatorial Algorithms
Multiway Cuts in Directed and Node Weighted Graphs
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Approximating Directed Multicuts
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
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
The multi-multiway cut problem
Theoretical Computer Science
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
On the complexity of the multicut problem in bounded tree-width graphs and digraphs
Discrete Applied Mathematics
Polynomial flow-cut gaps and hardness of directed cut problems
Journal of the ACM (JACM)
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
Fixed-parameter tractability of multicut parameterized by the size of the cutset
Proceedings of the forty-third annual ACM symposium on Theory of computing
Register loading via linear programming
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Approximation algorithm for directed multicuts
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Distributing Data for Secure Database Services
Transactions on Data Privacy
Theoretical Computer Science
Sparse WiFi deployment for vehicular internet access with bounded interconnection gap
IEEE/ACM Transactions on Networking (TON)
Completely inapproximable monotone and antimonotone parameterized problems
Journal of Computer and System Sciences
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
Journal of the ACM (JACM)
| Hi-index | 0.00 |
We give a simple algorithm for the Minimum Directed Multicut problem, and show that it gives an O(√n)-approximation. This improves on the previous approximation guarantee of O(√n log k) of Cheriyan, Karloff and Rabani [1], which was obtained by a more sophisticated algorithm.