Approximation algorithms for the Bipartite Multicut problem

Authors:
Sreyash Kenkre;Sundar Vishwanathan
Affiliations:
Department of Computer Science & Engineering, IIT Bombay, Powai 400076, India;Department of Computer Science & Engineering, IIT Bombay, Powai 400076, India
Venue:
Information Processing Letters
Year:
2010

Citing 4
Cited 1

Approximation algorithms

Approximation algorithms
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications

SIAM Journal on Computing
Expander flows, geometric embeddings and graph partitioning

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

Some heuristics for the binary paint shop problem and their expected number of colour changes

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.89

Visualization

Abstract

We introduce the Bipartite Multicut problem. This is a generalization of the st-Mincut problem is similar to the Multicut problem and also turns out to be an immediate generalization of the Min UnCut problem. We prove that this problem is NP-hard and then present an SDP based approximation algorithm. The SDP based approximation algorithm uses the structure theorem of @?"2^2 metrics along with region growing techniques.