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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We construct a minimum tree for some boundary symmetric tetrahedra R^3, whichhas two nodes (interior points) with equal weights (positive numbers) havingthe property that the common perpendicular of some two opposite edges passesthrough their midpoints. We prove that the length of this minimum tree may havelength less than the length of the full Steiner tree for the same boundarysymmetric tetrahedra.

Some minimum networks for four points in the three dimensional Euclidean Space