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

In the Euclidean $k$-TSP (resp. Euclidean $k$-MST), we are given $n$ pointsin the $d$-dimensional Euclidean space (for any fixed constant $d\geq 2$) and apositive integer $k$, the goal is to find a shortest tour visiting at least $k$points (resp. a minimum tree spanning at least $k$ points).  We give approximation schemes for both Euclidean $k$-TSP and Euclidean$k$-MST in time $2^{O(1/\varepsilon^{d-1})}\cdot n \cdot(\log n)^{d\cdot4^{d}}$. This improves the running time of the previous approximation schemesdue to Arora [J. ACM 1998] and Mitchell [SICOMP 1999]. Our algorithms can bederandomized by increasing the running time by a factor $O(n^d)$. In addition,our algorithm for Euclidean $k$-TSP is Gap-ETH tight, given the matchingGap-ETH lower bound due to Kisfaludi-Bak, Nederlof, and W\k{e}grzycki [FOCS2021].

Faster Approximation Schemes for $k$-TSP and $k$-MST in the Euclidean Space