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 a weighted graph G = (V, E, w) with a set of k terminals T ⊂ V, the Steiner Point Removal problem seeks for a minor of the graph with vertex set T, such that the distance between every pair of terminals is preserved within a small multiplicative distortion. Kamma, Krauthgamer and Nguyen [13] used a ball-growing algorithm to show that the distortion is at most O(log5 k) for general graphs. In this paper, we improve the distortion bound to O(log2 k). The improvement is achieved based on a known algorithm that constructs terminal-distance exact-preservation minor with O(k4) (which is independent of |V|) vertices, and also two tail bounds on the sums of independent exponential random variables, which allow us to show that it is unlikely for a non-terminal being contracted to a distant terminal.

Steiner Point Removal — Distant Terminals Don't (Really) Bother