Parameterized complexity dichotomy for Steiner Multicut

Karl Bringmann, Dan Hermelin, Matthias Mnich, Erik Jan Van Leeuwen

Research output: Contribution to journalConference articlepeer-review

5 Scopus citations

Abstract

We consider the Steiner Multicut problem, which asks, given an undirected graph G, a collection T{script} = {T1, ⋯, Tt}, Ti ⊆ 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 Ti at least one pair of terminals is in different connected components of G \ S. This problem generalizes several well-studied graph cut problems, in particular the Multicut problem, which corresponds to the case p = 2. The Multicut problem was recently shown to be fixed-parameter tractable for parameter k [Marx and Razgon, Bousquet et al., STOC 2011]. The question whether this result generalizes to Steiner Multicut motivates the present work. We answer the question that motivated this work, and in fact provide a dichotomy of the parameterized complexity of Steiner Multicut on general graphs. That is, 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 or that the problem is hard (W[1]-hard or even (para-)NP-complete). Among the many results in the paper, we highlight that: ▪ The edge deletion version of Steiner Multicut is fixed-parameter tractable for parameter k + t on general graphs (but has no polynomial kernel, even on trees). ▪ In contrast, both node deletion versions of Steiner Multicut are W[1]-hard for the parameter k + t on general graphs. ▪ All versions of Steiner Multicut are W[1]-hard for the parameter k, even when p = 3 and the graph is a tree plus one node. Since we allow k, t, p, and tw(G) to be any constants, our characterization includes a dichotomy for Steiner Multicut on trees (for tw(G) = 1) as well as a polynomial time versus NP-hardness dichotomy (by restricting k, t, p, tw(G) to constant or unbounded).

Original languageEnglish GB
Pages (from-to)157-170
Number of pages14
JournalLeibniz International Proceedings in Informatics, LIPIcs
DOIs
StatePublished - 1 Feb 2015
Event32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015 - Garching, Germany
Duration: 4 Mar 20157 Mar 2015

Keywords

  • Fixed-parameter tractability
  • Graph cut problems
  • Steiner cut

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Parameterized complexity dichotomy for Steiner Multicut'. Together they form a unique fingerprint.

Cite this