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

In this paper, we consider the Online Traveling Salesperson Problem (OLTSP)where the locations of the requests are known in advance, but not their arrivaltimes. We study both the open variant, in which the algorithm is not requiredto return to the origin when all the requests are served, as well as the closedvariant, in which the algorithm has to return to the origin after serving allthe requests. Our aim is to measure the impact of the extra knowledge of thelocations on the competitiveness of the problem. We present an online3/2-competitive algorithm for the general case and a matching lower bound forboth the open and the closed variant. Then, we focus on some interesting metricspaces (ring, star, semi-line), providing both lower bounds and polynomial timeonline algorithms for the problem.

Online TSP with Known Locations