On weighted graph separation problems and flow-augmentation
share
One of the first application of the recently introduced technique of flow-augmentation [Kim et al., STOC 2022] is a fixed-parameter algorithm for the weighted version of Directed Feedback Vertex Set, a landmark problem in parameterized complexity. In this note we explore applicability of flow-augmentation to other weighted graph separation problems parameterized by the size of the cutset. We show the following. – In weighted undirected graphs Multicut is FPT, both in the edge- and vertex-deletion version. – The weighted version of Group Feedback Vertex Set is FPT, even with an oracle access to group operations. – The weighted version of Directed Subset Feedback Vertex Set is FPT. Our study reveals Directed Symmetric Multicut as the next important graph separation problem whose parameterized complexity remains unknown, even in the unweighted setting.
READ FULL TEXT