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 Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Given an on-going sports competition, with each team having a current score and some matches left to be played, we ask whether it is possible for our distinguished team  to obtain a final standing with at most  teams finishing before . We study the computational complexity of this problem, addressing it both from the viewpoint of parameterized complexity and of approximation. We focus on a special case equivalent to finding a maximal induced subgraph of a given graph  that admits an orientation where the in-degree of each vertex is upper-bounded by a given function. We obtain a  approximation for this problem based on an asymptotically optimal approximation we present for a certain matroid problem in which we need to cover a base of a matroid by picking elements from a set family.

A Connection Between Sports and Matroids: How Many Teams Can We Beat?