Kernelization of Maximum Minimal Vertex Cover

02/04/2021
by   Júlio Araújo, et al.
0

In the Maximum Minimal Vertex Cover (MMVC) problem, we are given a graph G and a positive integer k, and the objective is to decide whether G contains a minimal vertex cover of size at least k. Motivated by the kernelization of MMVC with parameter k, our main contribution is to introduce a simple general framework to obtain lower bounds on the degrees of a certain type of polynomial kernels for vertex optimization problems, which we call lop-kernels. Informally, this type of kernels is required to preserve large optimal solutions in the reduced instance, and captures the vast majority of existing kernels in the literature. As a consequence of this framework, we show that the trivial quadratic kernel for MMVC is essentially optimal, answering a question of Boria et al. [Discret. Appl. Math. 2015], and that the known cubic kernel for Maximum Minimal Feedback Vertex Set is also essentially optimal. On the positive side, given the (plausible) non-existence of subquadratic kernels for MMVC on general graphs, we provide subquadratic kernels on H-free graphs for several graphs H, such as the bull, the paw, or the complete graphs, by making use of the Erdős-Hajnal property in order to find an appropriate decomposition. Finally, we prove that MMVC does not admit polynomial kernels parameterized by the size of a minimum vertex cover of the input graph, even on bipartite graphs, unless NP⊆ coNP / poly. This indicates that parameters smaller than the solution size are unlike to yield polynomial kernels for MMVC.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/13/2017

Smaller parameters for vertex cover kernelization

We revisit the topic of polynomial kernels for Vertex Cover relative to ...
research
02/07/2017

Propagation via Kernelization: The Vertex Cover Constraint

The technique of kernelization consists in extracting, from an instance ...
research
03/05/2021

Essentially Tight Kernels for (Weakly) Closed Graphs

We study kernelization of classic hard graph problems when the input gra...
research
12/07/2018

Kernelization of Packing Problems

Kernelization algorithms are polynomial-time reductions from a problem t...
research
05/09/2019

Elimination Distances, Blocking Sets, and Kernels for Vertex Cover

The Vertex Cover problem plays an essential role in the study of polynom...
research
07/06/2021

On the Hardness of Compressing Weights

We investigate computational problems involving large weights through th...
research
06/09/2022

Kernelization for Feedback Vertex Set via Elimination Distance to a Forest

We study efficient preprocessing for the undirected Feedback Vertex Set ...

Please sign up or login with your details

Forgot password? Click here to reset