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/

Zendy Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Given a set $P$ of $n$ points with their pairwise distances, the travelingsalesman problem (TSP) asks for a shortest tour that visits each point exactlyonce. A TSP instance is rectilinear when the points lie in the plane and thedistance considered between two points is the $l_1$ distance. In this paper, afixed-parameter algorithm for the Rectilinear TSP is presented and relies ontechniques for solving TSP on bounded-treewidth graphs. It proves that theproblem can be solved in $O\left(nh7^h\right)$ where $h \leq n$ denotes thenumber of horizontal lines containing the points of $P$. The same technique canbe directly applied to the problem of finding a shortest rectilinear Steinertree that interconnects the points of $P$ providing a $O\left(nh5^h\right)$time complexity. Both bounds improve over the best time bounds known for theseproblems.

Fixed-Parameter Algorithms for Rectilinear Steiner tree and Rectilinear Traveling Salesman Problem in the plane