Daniel Golovin
ABSTRACT
We study the k-multicut problem: Given an edge-weighted undirected graph, a set of l pairs of vertices, and a target k ≤ l, find the minimum cost set of edges whose removal disconnects at least k pairs. This generalizes the well known multicut problem, where k = l. We show that the k-multicut problem on trees can be approximated within a factor of 8/3 + ε, for any fixed ε > 0, and within O(log2 n log log n) on general graphs, where n is the number of vertices in the graph.For any fixed ε > 0, we also obtain a polynomial time algorithm for k-multicut on trees which returns a solution of cost at most (2 + ε) · OPT, that separates at least (1 - ε) · k pairs, where OPT is the cost of the optimal solution separating k pairs.Our techniques also give a simple 2-approximation algorithm for the multicut problem on trees using total unimodularity, matching the best known algorithm [8].
Index Terms
- Approximating the k-multicut problem
Recommendations
Approximating multicut and the demand graph
SODA '17: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete AlgorithmsIn the minimum Multicut problem, the input is an edge-weighted supply graph G = (V, E) and a demand graph H = (V, F). Either G and H are directed (Dir-MulC) or both are undirected (Undir-MulC). The goal is to remove a minimum weight set of supply edges ...
Approximating the Maximum Internal Spanning Tree problem
Given an undirected connected graph G we consider the problem of finding a spanning tree of G which has a maximum number of internal (non-leaf) vertices among all spanning trees of G. This problem, called Maximum Internal Spanning Tree problem, is ...
ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT
We show that the Multicut , Sparsest-Cut , and Min -2CNF Deletion problems are NP-hard to approximate within every constant factor, assuming the Unique Games Conjecture of Khot (2002). A quantitatively stronger version of the conjecture implies an ...
Comments