Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals

02/19/2019
by   Fedor V. Fomin, et al.
0

Perturbed graphic matroids are binary matroids that can be obtained from a graphic matroid by adding a noise of small rank. More precisely, r-rank perturbed graphic matroid M is a binary matroid that can be represented in the form I +P, where I is the incidence matrix of some graph and P is a binary matrix of rank at most r. Such matroids naturally appear in a number of theoretical and applied settings. The main motivation behind our work is an attempt to understand which parameterized algorithms for various problems on graphs could be lifted to perturbed graphic matroids. We study the parameterized complexity of a natural generalization (for matroids) of the following fundamental problems on graphs: Steiner Tree and Multiway Cut. In this generalization, called the Space Cover problem, we are given a binary matroid M with a ground set E, a set of terminals T⊆ E, and a non-negative integer k. The task is to decide whether T can be spanned by a subset of E∖ T of size at most k. We prove that on graphic matroid perturbations, for every fixed r, Space Cover is fixed-parameter tractable parameterized by k. On the other hand, the problem becomes W[1]-hard when parameterized by r+k+|T| and it is NP-complete for r≤ 2 and |T|≤ 2. On cographic matroids, that are the duals of graphic matroids, Space Cover generalizes another fundamental and well-studied problem, namely Multiway Cut. We show that on the duals of perturbed graphic matroids the Space Cover problem is fixed-parameter tractable parameterized by r+k.

READ FULL TEXT
research
03/16/2018

Parameterized Low-Rank Binary Matrix Approximation

We provide a number of algorithmic results for the following family of p...
research
10/06/2017

Covering vectors by spaces: Regular matroids

Seymour's decomposition theorem for regular matroids is a fundamental re...
research
10/27/2019

On the Parameterized Complexity of Sparsest Cut and Small-set Expansion Problems

We study the NP-hard k-Sparsest Cut problem (kSC) in which, given an und...
research
06/24/2020

Kernelization of Whitney Switches

A fundamental theorem of Whitney from 1933 asserts that 2-connected grap...
research
05/07/2020

Imbalance Parameterized by Twin Cover Revisited

We study the problem of Imbalance parameterized by the twin cover of a g...
research
08/26/2022

The Parameterized Complexity Binary CSP for Graphs with a Small Vertex Cover and Related Results

In this paper, we show that Binary CSP with the size of a vertex cover a...
research
11/04/2019

On Clustering Incomplete Data

We study fundamental clustering problems for incomplete data. In this se...

Please sign up or login with your details

Forgot password? Click here to reset