The Complexity of Multiterminal Cuts
SIAM Journal on Computing
Minimum multiway cuts in trees
Discrete Applied Mathematics
An improved approximation algorithm for MULTIWAY CUT
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Information Processing Letters
Approximation algorithms
Multiway Cuts in Directed and Node Weighted Graphs
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut
Mathematics of Operations Research
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
IEEE Transactions on Software Engineering
Hi-index | 0.04 |
In the MULTIWAY CUT problem, we are given an undirected edge-weighted graph G=(V,E) with c"e denoting the cost (weight) of edge e. We are also given a subset S of V, of size k, called the terminals. The objective is to find a minimum cost set of edges whose removal ensures that the terminals are disconnected. In this paper, we study a bidirected linear programming relaxation of MULTIWAY CUT. We resolve an open problem posed by Vazirani [Approximation Algorithms, first ed., Springer, Berlin, Heidelberg, 2001], and show that the integrality gap of this relaxation is not better than that for a geometric linear programming relaxation given by Ca@?linescu et al. [J. Comput. System Sci. 60(3) (2000) 564-574], and may be strictly worse on some instances.