DeepAI AI Chat
Log In Sign Up

Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth

by   Benjamin Bergougnoux, et al.

The Cut Count technique and the rank-based approach have lead to single-exponential FPT algorithms parameterized by treewidth, that is, running in time 2^O(tw)n^O(1), for Feedback Vertex Set and connected versions of the classical graph problems (such as Vertex Cover and Dominating Set). We show that Subset Feedback Vertex Set, Subset Odd Cycle Transversal, Restricted Edge-Subset Feedback Edge Set, Node Multiway Cut, and Multiway Cut are unlikely to have such running times. More precisely, we match algorithms running in time 2^O(tw log tw)n^O(1) with tight lower bounds under the Exponential-Time Hypothesis (ETH), ruling out 2^o(tw log tw)n^O(1), where n is the number of vertices and tw is the treewidth of the input graph. Our algorithms extend to the weighted case, while our lower bounds also hold for the larger parameter pathwidth and do not require weights. We also show that, in contrast to Odd Cycle Transversal, there is no 2^o(tw log tw)n^O(1)-time algorithm for Even Cycle Transversal under the ETH.


Tight Bounds for Connectivity Problems Parameterized by Cutwidth

In this work we start the investigation of tight complexity bounds for c...

Close relatives (of Feedback Vertex Set), revisited

At IPEC 2020, Bergougnoux, Bonnet, Brettell, and Kwon showed that a numb...

Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs

We design the first subexponential-time (parameterized) algorithms for s...

Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions

We provide a general framework to exclude parameterized running times of...

A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs

Subexponential parameterized algorithms are known for a wide range of na...

Solving connectivity problems parameterized by treedepth in single-exponential time and polynomial space

A breakthrough result of Cygan et al. (FOCS 2011) showed that connectivi...

Waypoint Routing on Bounded Treewidth Graphs

In the Waypoint Routing Problem one is given an undirected capacitated a...