On a bidirected relaxation for the MULTIWAY CUT problem

Authors:
Chandra Chekuri;Anupam Gupta;Amit Kumar
Affiliations:
Lucent Bell Labs, Murray Hill, NJ;Department of Computer Science, Carnegie Mellon University and Lucent Bell Labs;Department of Computer Science, Indian Institute of Technology, Hauz Khas, New Delhi, India
Venue:
Discrete Applied Mathematics - Special issue: Max-algebra
Year:
2005

Citing 7
Cited 0

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
A lower bound of 8/7+1k-1 on the integrality ratio of the Călinescu-Karloff-Rabani relaxation for multiway cut

Information Processing Letters
Approximation algorithms

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the MULTIWAY CUT problem, we are given an undirected edge-weighted graph G = (V, E) with ce 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 Calinescu et al. [J. Comput. System Sci. 60(3) (2000) 564-574], and may be strictly worse on some instances.