On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs

by   Vahan Mkrtchyan, et al.

In the classical partial vertex cover problem, we are given a graph G and two positive integers R and L. The goal is to check whether there is a subset V' of V of size at most R, such that V' covers at least L edges of G. The problem is NP-hard as it includes the Vertex Cover problem. Previous research has addressed the extension of this problem where one has weight-functions defined on sets of vertices and edges of G. In this paper, we consider the following version of the problem where on the input we are given an edge-weighted bipartite graph G, and three positive integers R, S and T. The goal is to check whether G has a subset V' of vertices of G of size at most R, such that the edges of G covered by V' have weight at least S and they include a matching of weight at least T. In the paper, we address this problem from the perspective of fixed-parameter tractability. One of our hardness results is obtained via a reduction from the bi-objective knapsack problem, which we show to be W[1]-hard with respect to one of parameters. We believe that this problem might be useful in obtaining similar results in other situations.


page 1

page 2

page 3

page 4


Parameterized algorithms for Partial vertex covers in bipartite graphs

In the weighted partial vertex cover problem (WPVC), we are given a grap...

Partial vertex covers and the complexity of some problems concerning static and dynamic monopolies

Let G be a graph and τ be an assignment of nonnegative integer threshold...

Multistage Vertex Cover

Covering all edges of a graph by a minimum number of vertices, this is t...

Fixed-Parameter Algorithms for Graph Constraint Logic

Non-deterministic constraint logic (NCL) is a simple model of computatio...

Covering a tree with rooted subtrees

We consider the multiple traveling salesman problem on a weighted tree. ...

Stackelberg Vertex Cover on a Path

A Stackelberg Vertex Cover game is played on an undirected graph 𝒢 where...

How many matchings cover the nodes of a graph?

Given an undirected graph, are there k matchings whose union covers all ...

Please sign up or login with your details

Forgot password? Click here to reset