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

Given an edge weighted graph and a forest $F$, the $\textit{2-edgeconnectivity augmentation problem}$ is to pick a minimum weighted set of edges,$E'$, such that every connected component of $E'\cup F$ is 2-edge connected.Williamson et al. gave a 2-approximation algorithm (WGMV) for this problemusing the primal-dual schema. We show that when edge weights are integral, theWGMV procedure can be modified to obtain a half-integral dual. The 2-edgeconnectivity augmentation problem has an interesting connection to routing flowin graphs where the union of supply and demand is planar. The half-integralityof the dual leads to a tight 2-approximate max-half-integral-flow min-multicuttheorem.

Dual Half-integrality for Uncrossable Cut Cover and its Application to Maximum Half-Integral Flow