English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In the classical partial vertex cover problem, we are given a graph $G$ andtwo positive integers $R$ and $L$. The goal is to check whether there is asubset $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 hasweight-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 aregiven 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 weightat 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-objectiveknapsack problem, which we show to be W[1]-hard with respect to one ofparameters. We believe that this problem might be useful in obtaining similarresults in other situations.

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