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

An improved fully polynomial-time approximation scheme and a greedy heuristicfor the fractional length-bounded maximum multicommodity flow problem with unitedge-lengths are proposed. Computational experiments are carried out onbenchmark graphs and on graphs that model software defined satellite networksto compare the proposed algorithms and an exact linear programming solver. Theresults of experiments demonstrate a trade-off between the computing time andthe precision of algorithms under consideration.

Approximate solution of length-bounded maximum multicommodity flow with unit edge-lengths