A faster strongly polynomial minimum cost flow algorithm
Operations Research
The Complexity of Multiterminal Cuts
SIAM Journal on Computing
Cut problems and their application to divide-and-conquer
Approximation algorithms for NP-hard problems
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
SIAM Journal on Computing
| Hi-index | 0.00 |
We present an O(min(Kn,n^2)) algorithm to solve the maximum integral multiflow and minimum multicut problems in rooted trees, where K is the number of commodities and n is the number of vertices. These problems are NP-hard in undirected trees but polynomial in directed trees. In the algorithm we propose, we first use a greedy procedure to build the multiflow then we use duality properties to obtain the multicut and prove the optimality.