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

We show that for every $n$-point metric space $M$ there exists a spanningtree $T$ with unweighted diameter $O(\log n)$ and weight $\omega(T) = O(\log n)\cdot \omega(MST(M))$. Moreover, there is a designated point $rt$ such that forevery point $v$, $dist_T(rt,v) \le (1+\epsilon) \cdot dist_M(rt,v)$, for anarbitrarily small constant $\epsilon > 0$. We extend this result, and provide atradeoff between unweighted diameter and weight, and prove that this tradeoffis \emph{tight up to constant factors} in the entire range of parameters. Theseresults enable us to settle a long-standing open question in ComputationalGeometry. In STOC'95 Arya et al. devised a construction of Euclidean Spannerswith unweighted diameter $O(\log n)$ and weight $O(\log n) \cdot\omega(MST(M))$. Ten years later in SODA'05 Agarwal et al. showed that thisresult is tight up to a factor of $O(\log \log n)$. We close this gap and showthat the result of Arya et al. is tight up to constant factors.

Shallow, Low, and Light Trees, and Tight Lower Bounds for Euclidean Spanners