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/

Zendy Plus

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

Zendy Tools

Zendy Open

We propose a \textit{purely combinatorial algorithm} for \mkvc{} in bipartitegraphs, achieving approximation ratio~0.7. The only combinatorial algorithmscurrently known until now for this problem are the natural greedy algorithm,that achieves ratio 0.632, and an easy~$2/3$-approximation algorithm presentedin \cite{DBLP:journals/corr/BonnetEPS14}.

Combinatorial approximation of maximum $k$-vertex cover in bipartite graphs within ratio~0.7