An improved approximation algorithm for multiway cut
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Finding almost-satisfying assignments
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Divide-and-conquer approximation algorithms via spreading metrics
Journal of the ACM (JACM)
Logical analysis of data with decomposable structures
Theoretical Computer Science
Large scale reconstruction of haplotypes from genotype data
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
Logical Analysis of Data with Decomposable Structures
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
A Polynomial Time Approximation Scheme for Dense MIN 2SAT
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Approximation schemes for clustering problems
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Constraint Satisfaction: The Approximability of Minimization Problems
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A Sublinear Time Approximation Scheme for Clustering in Metric Spaces
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
Random Structures & Algorithms
Efficient location area planning for personal communication systems
Proceedings of the 9th annual international conference on Mobile computing and networking
Multiway cuts in node weighted graphs
Journal of Algorithms
The directed circular arrangement problem
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A general approach to online network optimization problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
Journal of Algorithms
Approximating metrics by tree metrics
ACM SIGACT News
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
Oblivious routing on node-capacitated and directed graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Clustering with qualitative information
Journal of Computer and System Sciences - Special issue: Learning theory 2003
Correlation clustering in general weighted graphs
Theoretical Computer Science - Approximation and online algorithms
A general approach to online network optimization problems
ACM Transactions on Algorithms (TALG)
Efficient location area planning for personal communication systems
IEEE/ACM Transactions on Networking (TON)
Theoretical Computer Science
The multi-multiway cut problem
Theoretical Computer Science
A unified approach to approximating partial covering problems
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Path hitting in acyclic graphs
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Single source multiroute flows and cuts on uniform capacity networks
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Oblivious routing on node-capacitated and directed graphs
ACM Transactions on Algorithms (TALG)
Approximation algorithms for labeling hierarchical taxonomies
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Metric clustering via consistent labeling
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal hierarchical decompositions for congestion minimization in networks
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On the complexity of the multicut problem in bounded tree-width graphs and digraphs
Discrete Applied Mathematics
Approximating Generalized Multicut on Trees
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Polynomial flow-cut gaps and hardness of directed cut problems
Journal of the ACM (JACM)
Note: A simple algorithm for multicuts in planar graphs with outer terminals
Discrete Applied Mathematics
Role and channel assignments for wireless mesh networks using hybrid approach
Computer Networks: The International Journal of Computer and Telecommunications Networking
Constant ratio fixed-parameter approximation of the edge multicut problem
Information Processing Letters
Disjoint paths in sparse graphs
Discrete Applied Mathematics
Approximating the Maximum Agreement Forest on k trees
Information Processing Letters
Approximation algorithms for the Bipartite Multicut problem
Information Processing Letters
Pairwise data clustering and applications
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Approximation algorithms for k-hurdle problems
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
The directed circular arrangement problem
ACM Transactions on Algorithms (TALG)
The maximum multiflow problems with bounded fractionality
Proceedings of the forty-second ACM symposium on Theory of computing
Better vaccination strategies for better people
Proceedings of the 11th ACM conference on Electronic commerce
Untangling the cross-lingual link structure of Wikipedia
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Region growing for multi-route cuts
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Approximation and hardness results for label cut and related problems
Journal of Combinatorial Optimization
Edge Disjoint Paths in Moderately Connected Graphs
SIAM Journal on Computing
Distributing data for secure database services
Proceedings of the 4th International Workshop on Privacy and Anonymity in the Information Society
Fixed-parameter tractability of multicut parameterized by the size of the cutset
Proceedings of the forty-third annual ACM symposium on Theory of computing
The complexity and approximability of minimum contamination problems
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
An Efficient Algorithm for Haplotype Inference on Pedigrees with Recombinations and Mutations
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Multicommodity flows and cuts in polymatroidal networks
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms and hardness of the k-route cut problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximate duality of multicommodity multiroute flows and cuts: single source case
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Improved exact exponential algorithms for vertex bipartization and other problems
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Heuristic improvements for computing maximum multicommodity flow and minimum multicut
ESA'05 Proceedings of the 13th annual European conference on Algorithms
ESA'05 Proceedings of the 13th annual European conference on Algorithms
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Approximating the best-fit tree under Lp norms
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Edge disjoint paths in moderately connected graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Approximation algorithm for directed multicuts
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Improved fixed-parameter algorithms for two feedback set problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Algorithm engineering for optimal graph bipartization
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
An approximation algorithm for the Generalized k-Multicut problem
Discrete Applied Mathematics
Two-Server network disconnection problem
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Controlling infection by blocking nodes and links simultaneously
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Distributing Data for Secure Database Services
Transactions on Data Privacy
On vertex sparsifiers with Steiner nodes
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Approximation algorithms and hardness of integral concurrent flow
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Routing in undirected graphs with constant congestion
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Restricted vertex multicut on permutation graphs
Discrete Applied Mathematics
The maximum integer multiterminal flow problem in directed graphs
Operations Research Letters
On local search for the generalized graph coloring problem
Operations Research Letters
A greedy algorithm for multicut and integral multiflow in rooted trees
Operations Research Letters
Theoretical Computer Science
Sparse WiFi deployment for vehicular internet access with bounded interconnection gap
IEEE/ACM Transactions on Networking (TON)
On the complexity and approximation of the min-sum and min-max disjoint paths problems
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Approximating infeasible 2VPI-systems
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Simplex partitioning via exponential clocks and the multiway cut problem
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A derandomized approximation algorithm for the critical node detection problem
Computers and Operations Research
| Hi-index | 0.01 |
Consider the multicommodity flow problem in which the object is to maximize the sum of commodities routed. We prove the following approximate max-flow min-multicut theorem: $$ \dst \frac{\mbox{\rm min multicut}}{O(\log k)} \leq \mbox{ \rm max flow } \leq \mbox{ \rm min multicut}, $$ \noindent where $k$ is the number of commodities. Our proof is constructive; it enables us to find a multicut within $O(\log k)$ of the max flow (and hence also the optimal multicut). In addition, the proof technique provides a unified framework in which one can also analyse the case of flows with specified demands of Leighton and Rao and Klein et al. and thereby obtain an improved bound for the latter problem.