## Abstract

We consider the STEINER MULTICUT problem, which asks, given an undirected graph G, a collection tau = {T-1,, T-t}, T-i subset of V (G), of terminal sets of size at most p, and an integer k, whether there is a set S of at most k edges or nodes such that of each set T-i at least one pair of terminals is in different connected components of G - S. We provide a dichotomy of the parameterized complexity of STEINER MULTICUT. For any combination of k, t, p, and the treewidth tw(G) as constant, parameter, or unbounded, and for all versions of the problem (edge deletion and node deletion with and without deletable terminals), we prove either that the problem is fixed-parameter tractable, W[1} -hard, or (para-)NP-complete. Our characterization includes a dichotomy for STEINER MULTICUT on trees as well as a polynomial time versus NP-hardness dichotomy (by restricting k, t, p, tw(G) to constant or unbounded)

Original language | English |
---|---|

Pages (from-to) | 1020-1043 |

Number of pages | 24 |

Journal | Journal of Computer and System Sciences |

Volume | 82 |

Issue number | 6 |

DOIs | |

Publication status | Published - Sep 2016 |

## Keywords

- Cut problems
- Steiner multicut
- Parameterized complexity
- Kernelization
- TREEWIDTH
- APPROXIMATION ALGORITHM
- TRACTABILITY
- FLOW
- GRAPHS