Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
The Complexity of Multiterminal Cuts
SIAM Journal on Computing
On Integer Multiflow Maximization
SIAM Journal on Discrete Mathematics
A simple algorithm for the planar multiway cut problem
Journal of Algorithms
Approximation algorithms
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
SIAM Journal on Computing
A 2-Approximation Algorithm for the Directed Multiway Cut Problem
SIAM Journal on Computing
Multiway Cuts in Directed and Node Weighted Graphs
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Approximation algorithms for disjoint paths problems
Approximation algorithms for disjoint paths problems
Journal of Computer and System Sciences
Hardness of the undirected edge-disjoint paths problem
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A linear programming formulation of Mader's edge-disjoint paths problem
Journal of Combinatorial Theory Series B
Operations Research Letters
| Hi-index | 0.00 |
Given an arc-capacitated digraph and k terminal vertices, the directed maximum integer multiterminal flow problem is to route the maximum number of flow units between the terminals. We introduce a new parameter k"L=